Solving \(0/1\) integer programs with enumeration cutting planes

DOI10.1007/BF02085635zbMath0815.90115MaRDI QIDQ1339119

E. Andrew Boyd

Publication date: 1 December 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundreal-world applicationscutting plane technique

Mathematics Subject Classification ID

Integer programming (90C10) Boolean programming (90C09)

Related Items (6)

Integer programming techniques for the nurse rostering problem ⋮ Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure ⋮ Fenchel decomposition for stochastic mixed-integer programming ⋮ Integer set reduction for stochastic mixed-integer programming ⋮ Strong bounds with cut and column generation for class-teacher timetabling ⋮ Strong bounds for resource constrained project scheduling: preprocessing and cutting planes

Uses Software

• MIPLIB
• MINTO

Cites Work

• Unnamed Item
• Unnamed Item
• MINTO
• Geometric algorithms and combinatorial optimization
• MINTO, a Mixed INTeger Optimizer
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Outline of an algorithm for integer solutions to linear programs
• Solving Large-Scale Zero-One Linear Programming Problems
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• Finding the nearest point in A polytope
• Generating Fenchel Cutting Planes for Knapsack Polyhedra
• Fenchel Cutting Planes for Integer Programs
• Generalized Lagrange Multipliers in Integer Programming

This page was built for publication: Solving \(0/1\) integer programs with enumeration cutting planes