Integral Column Generation for Set Partitioning Problems with Side Constraints

DOI10.1287/ijoc.2022.1174OpenAlexW2998840417WikidataQ114058183 ScholiaQ114058183MaRDI QIDQ5106424

Guy Desaulniers, Adil Tahir, Issmail El Hallaoui

Publication date: 19 September 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2022.1174

zbMATH Keywords

discrete optimizationvehicle routing with time windowsintegral simplex using decompositionaircrew pairingintegral column generation

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items

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

Uses Software

• ISUD

Cites Work

• Unnamed Item
• Unnamed Item
• All-integer column generation for set partitioning: basic principles and extensions
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• Influence of the normalization constraint on the integral simplex using decomposition
• Column generation in the integral simplex method
• Multi-phase dynamic constraint aggregation for set partitioning type problems
• A general branch-and-bound algorithm for fair division problems
• Primal cutting plane algorithms revisited
• Improved integral simplex using decomposition for the set partitioning problem
• Dynamic constraint and variable aggregation in column generation
• Integral simplex using decomposition with primal cutting planes
• An integral simplex algorithm for solving combinatorial optimization problems
• Improving set partitioning problem solutions by zooming around an improving direction
• Solving the electricity production planning problem by a column generation based heuristic
• The feasibility pump
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Integral Simplex Using Decomposition for the Set Partitioning Problem
• Column Generation based Primal Heuristics
• An Improved Primal Simplex Algorithm for Degenerate Linear Programs
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• A unified tabu search heuristic for vehicle routing problems with time windows
• Primal Heuristics for Branch and Price: The Assets of Diving Methods
• Primal Heuristics for Branch-and-Price Algorithms
• Column Generation
• Shortest Path Problems with Resource Constraints
• Implementing Mixed Integer Column Generation
• On the Set-Covering Problem
• An integer programming column generation principle for heuristic search methods

This page was built for publication: Integral Column Generation for Set Partitioning Problems with Side Constraints