Two Rules for Deducing Valid Inequalities for 0-1 Problems
From MaRDI portal
Publication:4109509
DOI10.1137/0131054zbMath0341.90054OpenAlexW2065804773MaRDI QIDQ4109509
No author found.
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
Related Items
Extensions of a theorem of Balas ⋮ Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints ⋮ Mixed logical-linear programming ⋮ Lift-and-project for mixed 0-1 programming: recent progress ⋮ Modeling disjunctive constraints with a logarithmic number of binary variables and constraints ⋮ Elementary closures for integer programs. ⋮ Two mixed integer programming formulations arising in manufacturing management ⋮ Implied constraints and an alternate unified development of nonlinear programming theory ⋮ A recursive procedure to generate all cuts for 0-1 mixed integer programs ⋮ Implied constraints and a unified theory of duality in linear and nonlinear programming ⋮ Projection, lifting and extended formulation integer and combinatorial optimization
