An In-Out Approach to Disjunctive Optimization

DOI10.1007/978-3-642-13520-0_17zbMath1285.90018OpenAlexW1626873554MaRDI QIDQ3569927

Matteo Fischetti, Domenico Salvagnin

Publication date: 22 June 2010

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13520-0_17

zbMATH Keywords

cutting planesmixed-integer programmingdisjunctive optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Reformulating the disjunctive cut generating linear program, Benders decomposition without separability: a computational study for capacitated facility location problems, On optimizing over lift-and-project closures, The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs, Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing, A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints, Coordinated cutting plane generation via multi-objective separation, Reflections on generating (disjunctive) cuts, Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation, Lift-and-Project Cuts for Mixed Integer Convex Programs, Solving minimum-cost shared arborescence problems, Four Good Reasons to Use an Interior Point Solver Within a MIP Solver, ``Facet separation with one linear program

Uses Software

• MIPLIB
• OR-Library
• MIPLIB2003