Modelling either-or relations in integer programming
From MaRDI portal
Publication:1026568
DOI10.1007/s10479-008-0409-zzbMath1163.90662OpenAlexW2069345479MaRDI QIDQ1026568
John M. Wilson, Bilal Toklu, Les R. Foulds
Publication date: 25 June 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0409-z
Uses Software
Cites Work
- Unnamed Item
- Projection, lifting and extended formulation integer and combinatorial optimization
- Logical processing for integer programming
- Constructing integer programming models by the predicate calculus
- Representability in mixed integer programming. I: Characterization results
- An algorithm for disjunctive programs
- The splitting of variables and constraints in the formulation of integer programming models
- Disjunctive programming: Properties of the convex hull of feasible points
- Tight representation of logical constraints as cardinality rules
- Tools for reformulating logical forms into zero-one mixed integer programs
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- A strategic model for supply chain design with logical constraints: Formulation and solution.
- On unions and dominants of polytopes
- Crew assignment via constraint programming: Integrating column generation and heuristic tree search
- Logic-based 0-1 constraint programming
- Mixed logical-linear programming
- A heuristic for multiple-feeder PCB manufacturing
- Modelling with integer variables
- Experimental Results on the New Techniques for Integer Programming Formulations
- Disjunctive Programming
- Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
- A Class of Hard Small 0-1 Programs
This page was built for publication: Modelling either-or relations in integer programming
