Blocking and Antiblocking Polyhedra

DOI10.1016/S0167-5060(08)70823-9zbMATH Open0411.05031OpenAlexW194194514MaRDI QIDQ4198784FDOQ4198784

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

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

zbMATH Keywords

linear programmingcombinatoricsconvex analysisinteger programmingblocking polyhedracontinuous problemsanti-blocking polyhedra

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
• On a certain class of polytopes associated with independence systems.
• Title not available (Why is that?)
• Title not available (Why is that?)
• On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
• Dynamic decomposition method for linear programming problems with ceneralized upper bounds
• A generalization of Robacker's theorem

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)