Deriving compact extended formulations via LP-based separation techniques
From MaRDI portal
Publication:5892024
DOI10.1007/s10288-014-0262-7zbMath1302.90133OpenAlexW1968990060MaRDI QIDQ5892024
Giuseppe Lancia, Paolo Serafini
Publication date: 17 December 2014
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-014-0262-7
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Twelve surveys in operations research ⋮ An extended formulation for the 1‐wheel inequalities of the stable set polytope ⋮ Surveys in operations research ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Deriving compact extended formulations via LP-based separation techniques
Cites Work
- Unnamed Item
- Exact solution of the robust knapsack problem
- A time-indexed LP-based approach for min-sum job-shop problems
- On cuts and matchings in planar graphs
- Solution of large-scale symmetric travelling salesman problems
- Matrices with the Edmonds-Johnson property
- Experiments in quadratic 0-1 programming
- Using separation algorithms to generate mixed integer model reformulations
- Exact solution of bin-packing problems using column generation and branch-and-bound
- On certain polytopes associated with graphs
- Robust discrete optimization and network flows
- Compact vs. exponential-size LP relaxations
- Compact optimization can outperform separation: a case study in structural proteomics
- LP models for bin packing and cutting stock problems
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- An effective compact formulation of the max cut problem on sparse graphs
- Sorting Permutations by Reversals Through Branch-and-Price
- Constructing Extended Formulations from Reflection Relations
- Optimum Communication Spanning Trees
- A Linear Programming Approach to the Cutting-Stock Problem
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- The Price of Robustness
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- Packing cycles in undirected graphs
- Exact algorithms for minimum routing cost trees
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Solution of a Large-Scale Traveling-Salesman Problem
- On the Robust Knapsack Problem
- Linear vs. semidefinite extended formulations
- Extended formulations in combinatorial optimization
This page was built for publication: Deriving compact extended formulations via LP-based separation techniques
