Distributed integral column generation for set partitioning problems
From MaRDI portal
Publication:2139355
DOI10.1007/S43069-022-00136-WzbMATH Open1493.90111OpenAlexW4224298808MaRDI QIDQ2139355FDOQ2139355
Authors: Omar Foutlane, Pierre Hansen, Issmail Elhallaoui 
Publication date: 17 May 2022
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s43069-022-00136-w
Recommendations
Cites Work
- Integral simplex using decomposition for the set partitioning problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- Title not available (Why is that?)
- Crew pairing at Air France
- Branch-and-price: Column generation for solving huge integer programs
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- Decomposition Principle for Linear Programs
- Column generation based primal heuristics
- Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
- An improved primal simplex algorithm for degenerate linear programs
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- On the Set-Covering Problem: II. An Algorithm for Set Partitioning
- Integral simplex using decomposition with primal cutting planes
- Influence of the normalization constraint on the integral simplex using decomposition
- Integral simplex using double decomposition for set partitioning problems
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
- Improving set partitioning problem solutions by zooming around an improving direction
Cited In (6)
- All-integer column generation for set partitioning: basic principles and extensions
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Searching for optimal integer solutions to set partitioning problems using column generation
- Title not available (Why is that?)
- Distributed asynchronous column generation
- Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019
Uses Software
This page was built for publication: Distributed integral column generation for set partitioning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139355)
