Buscar
Mostrando ítems 11-20 de 24
Exact solutions of rectangular partitions via integer programming
(World Scientific Publ Co Pte LtdSingaporeSingapura, 2000)
The minor inequalities in the description of the set covering polyhedron of circulant matrices
(Springer Heidelberg, 2014-02)
In this work we give a complete description of the set covering polyhedron of circulant matrices Cskk with = 2, 3 and k ≥ 3 by linear inequalities. In particular, we prove that every non boolean facet defining inequality ...
Lift and project relaxations for the matching and related polytopes
(Elsevier Science, 2004-01)
We compare lift and project methods given by Lovász and Schrijver (the N+ and N procedures) and by Balas, Ceria and Cornuéjols (the disjunctive procedure) when working on the matching, perfect matching and covering polytopes. ...
Addendum to “Vertex adjacencies in the set covering polyhedron” [Discrete Appl. Math. 218 (2017) 40–56]
(Elsevier Science, 2018-07)
We study the relationship between the vertices of an up-monotone polyhedron R and those of the polytope P obtained by truncating R with the unit hypercube. When R has binary vertices, we characterize the vertices of P in ...
On packing and covering polyhedra of consecutive ones circulant clutters
(Elsevier Science, 2010-06)
Building on work by G. Cornuéjols and B. Novick and by L. Trotter, we give different characterizations of contractions of consecutive ones circulant clutters that give back consecutive ones circulant clutters. Based on a ...
An integer programming approach for the 2-class single-group classification problem
(Elsevier, 2019)
Two sets XB, XR ⊆ Rd are linearly separable if their convex hulls are disjoint, implying that a hyperplane separating XB from XR exists. Such a hyperplane provides a method for classifying new points, according to the side ...
The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
(Springer, 2015-12)
In this work we consider the uniform capacitated single-item single-machine lot-sizing problem with continuous start-up costs. A continuous start-up cost is generated in a period whenever there is a nonzero production in ...
Efficient implementation of Carathéodory’s theorem for the single machine scheduling polytope
(Elsevier, 2016)
In a fundamental paper in polyhedral combinatorics, Queyranne describes the complete facial structure of a classical object in combinatorial optimization, the single machine scheduling polytope. In the same paper, he answers ...