Blocking and Antiblocking Polyhedra

DOI10.1016/S0167-5060(08)70823-9MaRDI QIDQ4198784zbMATH OpenOpenAlexFDO

Authors 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

anti-blocking polyhedrablocking polyhedracombinatoricscontinuous problemsconvex analysisinteger programminglinear programming

Mathematics Subject Classification ID

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

Recommendations

• The disjunctive procedure and blocker duality
• scientific article; zbMATH DE number 3862930
• Polyhedral Combinatorics in Combinatorial Optimization
• A generalization of Robacker's theorem
• Polyhedral proof methods in combinatorial optimization

Cited in

(9)

• A generalization of Robacker's theorem
• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
• scientific article; zbMATH DE number 4174664 (Why is no real title available?)
• Dynamic decomposition method for linear programming problems with ceneralized upper bounds
• scientific article; zbMATH DE number 177550 (Why is no real title available?)
• On a certain class of polytopes associated with independence systems.
• scientific article; zbMATH DE number 7354649 (Why is no real title available?)
• On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
• Conformal hypergraphs: duality and implications for the upper clique transversal problem

This page was built for publication: Blocking and Antiblocking Polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198784)