We find new facet-defining inequalities for the linear ordering polytope generalizing the well-known Möbius ladder inequalities. Our starting point is to observe that the natural derivation of the Möbius ladder inequalities as {0, 1/2}-cuts produces triangulations of the Möbius band and of the corresponding (closed) surface, the projective plane. In that sense, Möbius ladder inequalities have the same "shape" as the projective plane. Inspired by the classification of surfaces, a classic result in topology, we prove that a surface has facet-defining {0, 1/2}-cuts of the same "shape" if and only if it is nonorientable. © 2006 Society for Industrial and Applied Mathematics.SCOPUS: ar.jinfo:eu-repo/semantics/publishe
A simple relaxation consisting of two rows of a simplex tableau is a mixed integer set with two equa...
AbstractGomory's cutting-plane technique can be viewed as a recursive procedure for proving the vali...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...
AbstractWe present new facets for the linear ordering polytope. These new facets generalize facets i...
In this paper we dicuss a facial structure of the linear ordering polytope. The facet-defining digra...
In this paper we present sufficient conditions for unweighted digraphs to induce facet-defining ineq...
The binary choice polytope appeared in the investigation of the binary choice problem formulated by ...
A simple relaxation consisting of two rows of a simplex tableau is a mixed-integer set with two equa...
The cut polytopeP n is the convex hull of the incidence vectors of the cuts (i.e. complete bipartite...
We study facets of the cut coneC n , i.e., the cone of dimension 1/2n(n − 1) generated by the cuts o...
A simple relaxation of two rows of a simplex tableau is a mixed integer set consisting of two equati...
We study new classes of facets for the cut coneC n generated by the cuts of the complete graph onn v...
In this paper the polyhedron of the cutting stock problem is investigated with respect to facet-defi...
Facets of the linear ordering polytope / Martin Grötschel ; Michael Jünger ; Gerhard Reinelt. - In: ...
The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality ...
A simple relaxation consisting of two rows of a simplex tableau is a mixed integer set with two equa...
AbstractGomory's cutting-plane technique can be viewed as a recursive procedure for proving the vali...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...
AbstractWe present new facets for the linear ordering polytope. These new facets generalize facets i...
In this paper we dicuss a facial structure of the linear ordering polytope. The facet-defining digra...
In this paper we present sufficient conditions for unweighted digraphs to induce facet-defining ineq...
The binary choice polytope appeared in the investigation of the binary choice problem formulated by ...
A simple relaxation consisting of two rows of a simplex tableau is a mixed-integer set with two equa...
The cut polytopeP n is the convex hull of the incidence vectors of the cuts (i.e. complete bipartite...
We study facets of the cut coneC n , i.e., the cone of dimension 1/2n(n − 1) generated by the cuts o...
A simple relaxation of two rows of a simplex tableau is a mixed integer set consisting of two equati...
We study new classes of facets for the cut coneC n generated by the cuts of the complete graph onn v...
In this paper the polyhedron of the cutting stock problem is investigated with respect to facet-defi...
Facets of the linear ordering polytope / Martin Grötschel ; Michael Jünger ; Gerhard Reinelt. - In: ...
The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality ...
A simple relaxation consisting of two rows of a simplex tableau is a mixed integer set with two equa...
AbstractGomory's cutting-plane technique can be viewed as a recursive procedure for proving the vali...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...