Reconstructing Convex Matrices by Integer Programming Approaches - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Mathematical Modelling and Algorithms in Operations Research Année : 2013

Reconstructing Convex Matrices by Integer Programming Approaches

Résumé

We consider the problem of reconstructing two-dimensional convex binary matrices from their row and column sums with adjacent ones. Instead of requiring the ones to occur consecutively in each row and column, we maximize the number of adjacent ones. We reformulate the problem by using integer programming and we develop approximate solutions based on linearization and convexification techniques.
Fichier non déposé

Dates et versions

hal-01126168 , version 1 (06-03-2015)

Identifiants

  • HAL Id : hal-01126168 , version 1

Citer

Alain Billionnet, Ghassen Tlig, Fethi Jarray, Ezzedine Zagrouba. Reconstructing Convex Matrices by Integer Programming Approaches. Journal of Mathematical Modelling and Algorithms in Operations Research, 2013, 12, pp.329-343. ⟨hal-01126168⟩
17 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More