Searching for optimal integer solutions to set partitioning problems using column generation
From MaRDI portal
Publication:5416769
DOI10.1111/itor.12050zbMath1291.90140OpenAlexW1976305426MaRDI QIDQ5416769
No author found.
Publication date: 15 May 2014
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11250/227270
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
An integer programming column generation principle for heuristic search methods ⋮ 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
Cites Work
- Stabilized column generation
- On some difficult linear programs coming from set partitioning
- A concurrent processing framework for the set partitioning problem
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- A relax-and-cut algorithm for the set partitioning problem
- Interior point stabilization for column generation
- Comparison of bundle and classical column generation
- A proximal trust-region algorithm for column generation stabilization
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems
- Some relationships between lagrangian and surrogate duality in integer programming
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Column Generation
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Selected Topics in Column Generation
This page was built for publication: Searching for optimal integer solutions to set partitioning problems using column generation
