Now showing items 1-10 of 12
The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
(Elsevier Science BvAmsterdamHolanda, 2000)
Vertex adjacencies in the set covering polyhedron
(Elsevier Science, 2017-02)
We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvátal for the stable set polytope. We find a sufficient condition for adjacency, ...
Lift-and-project ranks of the stable set polytope of joined a-perfect graphs
(Elsevier Science, 2016-09)
In this paper we study lift-and-project polyhedral operators defined by Lovász and Schrijver and Balas, Ceria and Cornuéjols on the clique relaxation of the stable set polytope of webs. We compute the disjunctive rank of ...
The maximum common edge subgraph problem: A polyhedral investigation
(Elsevier Science BvAmsterdamHolanda, 2012)
Rearrangement of DNA fragments: a branch-and-cut algorithms
(Elsevier Science BvAmsterdamHolanda, 2002)
Exact solutions of rectangular partitions via integer programming
(World Scientific Publ Co Pte LtdSingaporeSingapura, 2000)
The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
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
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 ...