Two Rules for Deducing Valid Inequalities for 0-1 Problems

DOI10.1137/0131054MaRDI QIDQ4109509zbMATH OpenOpenAlexFDO

Authors

Publication date 1976

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2142/141

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10)

Cited in

(11)

• Extensions of a theorem of Balas
• Two mixed integer programming formulations arising in manufacturing management
• Implied constraints and an alternate unified development of nonlinear programming theory
• Implied constraints and a unified theory of duality in linear and nonlinear programming
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Mixed logical-linear programming
• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Elementary closures for integer programs.
• Lift-and-project for mixed 0-1 programming: recent progress
• Projection, lifting and extended formulation integer and combinatorial optimization

This page was built for publication: Two Rules for Deducing Valid Inequalities for 0-1 Problems

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