Total dual integrality and integer polyhedra
From MaRDI portal
Publication:598999
DOI10.1016/0024-3795(79)90018-1zbMath0413.90054OpenAlexW2029880758MaRDI QIDQ598999
F. R. Giles, William R. Pulleyblank
Publication date: 1979
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(79)90018-1
integer programmingtotal dual integralityinteger polyhedraexistence of integer vertices of polytopes
Related Items
On box totally dual integral polyhedra, Minimal solutions of linear diophantine systems : bounds and algorithms, Coins and cones, Total dual dyadicness and dyadic generating sets, Strong connectivity of polyhedral complexes, Hilbert bases of cuts, Total dual integrality and integer polyhedra, Tessellation and \(g\)-tessellation of circulants, \(Q_ 6\), and \(Q_ 6^ t\), Polyhedral Combinatorics in Combinatorial Optimization, The Hilbert basis of the cut cone over the complete graph K 6, Total dual integrality implies local strong unimodularity, On Hilbert bases of cuts, The power of pyramid decomposition in Normaliz, Box-total dual integrality and edge-connectivity, Min–max optimization of node‐targeted attacks in service networks, A quadratic simplex algorithm for primal optimization over zero-one polytopes, Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes, On total dual integrality, Sensitivity theorems in integer linear programming, Total dual integrality and b-matchings, Non-standard approaches to integer programming, Recognizing conic TDI systems is hard, Local optimality subsets and global optimization: A prospective approach, The combinatorics of modeling and analyzing biological systems, Convexity and global optimization: A theoretical link, The structure of an integral monoid and integer programming feasibility, Total dual integrality and integral solutions of the linear complementarity problem, On a class of languages with holonomic generating functions, Gainfree Leontief substitution flow problems, A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations, Polyhedral techniques in combinatorial optimization I: Theory, Integral infeasibility and testing total dual integrality, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Operations that preserve total dual integrality, Duality in mathematics and linear and integer programming, On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties, Test sets of integer programs, Recent trends in combinatorial optimization, A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron, The minimal Hilbert basis of the Hammond order cone, A note on matchings and separability, Path-closed sets, Measuring with jugs, An integer analogue of Carathéodory's theorem
Cites Work
