Reconstructing Convex Matrices by Integer Programming Approaches - Archive ouverte HAL Access content directly
Journal Articles Journal of Mathematical Modelling and Algorithms in Operations Research Year : 2013

Reconstructing Convex Matrices by Integer Programming Approaches

Abstract

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.
No file

Dates and versions

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

Identifiers

  • HAL Id : hal-01126168 , version 1

Cite

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 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More