Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems
DOI10.1007/s12532-023-00240-wzbMath1519.90123OpenAlexW4366982354MaRDI QIDQ6095737
Elina Rönnberg, Stephen J. Maher
Publication date: 8 September 2023
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-023-00240-w
Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- All-integer column generation for set partitioning: basic principles and extensions
- Optimal interval scheduling with a resource constraint
- Column generation in the integral simplex method
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Two exact algorithms for the capacitated \(p\)-median problem
- Local branching
- An integral simplex algorithm for solving combinatorial optimization problems
- Hybrid metaheuristics. 7th international workshop, HM 2010, Vienna, Austria, October 1--2, 2010. Proceedings
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- A generic exact solver for vehicle routing and related problems
- An integer optimality condition for column generation on zero-one linear programs
- Measuring the impact of primal heuristics
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Integral Simplex Using Decomposition for the Set Partitioning Problem
- Column Generation based Primal Heuristics
- Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- A Method of Decomposition for Integer Programs
- A branch‐and‐price algorithm for the capacitated p‐median problem
- Integral Column Generation for Set Partitioning Problems with Side Constraints
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Primal Heuristics for Branch-and-Price Algorithms
- Selected Topics in Column Generation
- Searching for optimal integer solutions to set partitioning problems using column generation
- An integer programming column generation principle for heuristic search methods
This page was built for publication: Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems
