scientific article

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

survey polyhedra adjacency totally unimodular matrices linear programming duality totally dual integral systems combinatorial min-max theorems facet characterizations TDI systems

Mathematics Subject Classification ID

Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Polytopes and polyhedra (52Bxx)

Related Items

On the orthogonal Latin squares polytope, Near-perfect matrices, Polyhedral proof methods in combinatorial optimization, Stable matchings and linear inequalities, The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem, On the complexity of some basic problems in computational convexity. I. Containment problems, On box totally dual integral polyhedra, LP-based solution methods for the asymmetric TSP, Generalized polymatroids and submodular flows, Adjacency of vertices of the complete pre-order polytope, Forest covers and a polyhedral intersection theorem, The 2-matching lattice of a graph, Stable matchings and linear programming, Some thoughts on combinatorial optimisation, Polyhedra and optimization in connection with a weak majorization ordering, Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices, Facet Generating Techniques, On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph, An exact algorithm for the identical parallel machine scheduling problem., Polyhedral results for a vehicle routing problem, A spectral method for concordant polyhedral faces, The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities, Facets of two Steiner arborescence polyhedra, On cycle cones and polyhedra, The traveling salesman problem in graphs with some excluded minors, Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs, A weighted min-max relation for intervals, Adjacency of the 0-1 knapsack problem, Matching theory -- a sampler: From Dénes König to the present, The complexity of lifted inequalities for the knapsack problem, On the \(k\) edge-disjoint 2-hop-constrained paths polytope, On multi-index assignment polytopes, Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph, The polytope of degree sequences, Facets of the generalized permutahedron of a poset, The stable set polytope for some extensions of \(P_4\)-free graphs, The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints, Combinatorial optimization and small polytopes, On the dimension of projected polyhedra, On Latin squares and the facial structure of related polytopes, Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case, Clique facets of the axial and planar assignment polytopes, On the system of two all different\(\_\)predicates, \(k\)-edge connected polyhedra on series-parallel graphs, A cutting plane algorithm for the unrelated parallel machine scheduling problem, Survey of facial results for the traveling salesman polytope, A note on matchings and separability, On greedy bases packing in matroids, Canonical equation sets for classes of concordant polytopes, The facets of the polyhedral set determined by the Gale-Hoffman inequalities