Blocking and Antiblocking Polyhedra

DOI10.1016/S0167-5060(08)70823-9zbMath0411.05031OpenAlexW194194514MaRDI QIDQ4198784

Jørgen Tind

Publication date: 1979

Published in: Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70823-9

zbMATH Keywords

combinatoricslinear programminginteger programmingconvex analysisblocking polyhedracontinuous problemsanti-blocking polyhedra

Mathematics Subject Classification ID

Integer programming (90C10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Designs and configurations (05B99)

Related Items (2)

A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program ⋮ Dynamic decomposition method for linear programming problems with ceneralized upper bounds

This page was built for publication: Blocking and Antiblocking Polyhedra