Journal Article10.1007/S10479-012-1299-7
Constraint Programming-based Column Generation
21
TL;DR: This paper surveys recent applications and advances of the Constraint Programming-based Column Generation framework, where the master subproblem is solved by traditional OR techniques, while the pricing subproblem has been solved by Constrain Programming.
read more
Abstract: This paper surveys recent applications and advances of the Constraint Programming-based Column Generation framework, where the master subproblem is solved by traditional OR techniques, while the pricing subproblem is solved by Constraint Programming. This framework has been introduced to solve crew assignment problems, where complex regulations make the pricing subproblem demanding for traditional techniques, and then it has been applied to other contexts. The main benefits of using Constraint Programming are the expressiveness of its modeling language and the flexibility of its solvers. Recently, the Constraint Programming-based Column Generation framework has been applied to many other problems, ranging from classical combinatorial problems such as graph coloring and two dimensional bin packing, to application oriented problems, such as airline planning and resource allocation in wireless ad-hoc networks.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Branch-and-price and constraint programming for solving a real-life technician dispatching problem
TL;DR: A branch-and-price algorithm was developed, using a constraint branching strategy proposed by Ryan and Foster along with constraint programming in the column generation phase, to solve a real problem faced by a large company providing repair services of office machines in Santiago, Chile.
46
A branch-and-price approach to evaluate the role of cross-docking operations in consolidated supply chains
TL;DR: An efficient methodology for finding (near)optimal solutions in supply-chain management and optimization is described, based on the use of column generation embedded into an incomplete branch-and-price tree.
18
Delay and disruption management in local public transportation via real-time vehicle and crew re-scheduling: a case study
TL;DR: A simulation-based optimization system to cope with delays and small disruptions that can be effectively used in a real-time environment and takes into account both vehicle and driver scheduling is proposed.
15
A branch-and-price procedure for clustering data that are graph connected
TL;DR: In this paper , a branch-and-price (B&P) algorithm is proposed to solve the GCCP problem, which is based on the maximum-weighted graph-connected single-clique problem (MGCSC).
13
Delay Management in Public Transportation: Service Regularity Issues and Crew Re-scheduling
TL;DR: A tabu-search procedure for the online vehicle scheduling optimizing the regularity of the service and a column generation approach for the consequential crew re-scheduling minimizing the driver extra-time are described.
12
References
•Book
Integer programming
George L. Nemhauser,Laurence A. Wolsey +1 more
- 01 Jan 1972
TL;DR: The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization as mentioned in this paper, which is a standard of graduate-level courses since 1972.
4.6K
•Book
Knapsack Problems: Algorithms and Computer Implementations
Silvano Martello,Paolo Toth +1 more
- 01 Nov 1990
TL;DR: This paper focuses on the part of the knapsack problem where the problem of bin packing is concerned and investigates the role of computer codes in the solution of this problem.
4K
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Cynthia Barnhart,Ellis L. Johnson,George L. Nemhauser,Martin W. P. Savelsbergh,Pamela H. Vance +4 more
TL;DR: In this paper, column generation methods for integer programs with a huge number of variables are discussed, including implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branch-and-bound tree.
A Linear Programming Approach to the Cutting-Stock Problem
P. C. Gilmore,Ralph E. Gomory +1 more
TL;DR: In this paper, a technique is described for overcoming the difficulty in the linear programming formulation of the cutting-stock problem, which enables one to compute always with a matrix which has no more columns than it has rows.
2.1K
•Book
Handbook of Constraint Programming
Francesca Rossi,Peter van Beek,Toby Walsh +2 more
- 01 Jan 2006
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.