Lexicographical Order in Integer Programming - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Vietnam Journal of Mathematics Year : 2016

Lexicographical Order in Integer Programming


Forcing lexicographical order in the solutions to an integer programming problem is a possible strategy to avoid symmetric solutions. An orbisack is the convex hull of the lexicographically ordered pairs of n-dimensional binary vectors. In this paper, we present a minimal complete description of orbisacks. In addition, we provide a polynomial formulation with exponential coefficients and a formulation with an exponential number of constraints but with unit coefficients, both of which still force lexicographical order. An exact separation procedure is also described.
No file

Dates and versions

hal-01419551 , version 1 (19-12-2016)



Martine Labbé, Alfredo Marín, Antonio M. Rodríguez-Chía. Lexicographical Order in Integer Programming. Vietnam Journal of Mathematics, 2016, ⟨10.1007/s10013-016-0220-0⟩. ⟨hal-01419551⟩
113 View
0 Download



Gmail Facebook X LinkedIn More