Abstract. We present how to apply Constraint Based Column Generation to a large class of subproblems, namely Constrained Knapsack Problems (CKP). They evolve e.g. from Cutting Stock Problems (see [7]) with additional constraints on the cutting patterns. Focussing on Constrained Knapsack Problems, we developed a new reduction algorithm for KP. It is being used as propagation routine for the CKP with O(n log n) preprocessing time and O(n) time per call. This sums up to an amortized time of O(n) for (log n) calls.
|
5825
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 2001
|
|
877
|
Consistency in networks of relations
– Mackworth
- 1977
|
|
354
|
Networks of constraints: Fundamental properties and applications to picture processing
– Montanari
- 1974
|
|
170
|
A generic arc-consistency algorithm and its specializations
– hentenryck, Deville, et al.
- 1992
|
|
118
|
Branch-and-price: column generation for solving huge integer programs
– Barnhart, Johnson, et al.
- 1998
|
|
111
|
Arc-consistency and arc-consistency again
– Bessière
- 1994
|
|
101
|
Solving Airline CrewScheduling Problems by Branch-and-Cut
– HOFFMAN, PADBERG
- 1993
|
|
85
|
Time constrained routing and scheduling
– Desrochers, Dumas, et al.
- 1995
|
|
81
|
A linear programming approach to the cutting stock problem
– Gilmore, Gomory
- 1961
|
|
70
|
The Decomposition Algorithm for Linear Programs
– Dantzig, Wolfe
- 1961
|
|
45
|
Algorithms for the set covering problem
– Caprara, Fischetti, et al.
- 1998
|
|
42
|
Combinatorial problem solving in constraint logic programming with cooperating solvers
– Beringer, Backer
- 1995
|
|
37
|
Branch-and-Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
– Bockmayr, Kasper
- 1998
|
|
37
|
A computational study of constraint satisfaction for multiple capacitated job shop scheduling. European Journal of Operational Research. Accepted for publication
– Nuijten, Aarts
- 1995
|
|
31
|
A new approach to integrating mixed integer programming and constraint logic programming
– Rodosek, Wallace, et al.
- 1999
|
|
30
|
Discrete variables extremum problems
– Dantzig
- 1957
|
|
27
|
The solution of massive generalized set partitioning problems in aircrew rostering
– Ryan
- 1992
|
|
17
|
Modeling and solving the crew rostering problem
– Fischetti, Caprara, et al.
- 1998
|
|
17
|
Flight attendant rostering for short-haul airline operations
– Day, Ryan
- 1997
|
|
16
|
Branch and infer: A unifying framework for integer and finite domain constraint programming
– Bockmayr, Kasper
- 1998
|
|
15
|
An upper bound for the zero-one knapsack problem and a Branch and Bound algorithm
– Martello, Toth
- 1977
|
|
15
|
An expanding-core algorithm for the exact 0-1 knapsack problem
– Pisinger
- 1995
|
|
14
|
Solving large scale crew scheduling problems
– Chu, Gelman, et al.
- 1997
|
|
13
|
Crew Pairing at Air France
– Desaulniers, Desrosiers, et al.
- 1997
|
|
12
|
Crew pairing optimization
– Andersson, Housos, et al.
- 1998
|
|
11
|
An algorithm for the solution of the 0-1 knapsack problem
– Fayard, Plateau
- 1982
|
|
11
|
A New Algorithm for the 0-1 Knapsack Problem
– Martello, Toth
- 1988
|
|
11
|
Integrating constraint logic programming and operations research techniques for the crew rostering problem
– Caprara, Focacci, et al.
- 1998
|
|
10
|
Branch-and-Price: Column Generation for Huge Integer Programs
– Barnhart, Johnson, et al.
- 1998
|
|
9
|
A Reduction Algorithm for Knapsack Problems
– Dembo, Hammer
- 1980
|
|
9
|
The preferential bidding system at Air Canada
– Gamache, Soumis, et al.
- 1998
|
|
7
|
A Reduction Algorithm for Zero-One Single Knapsack Problems
– Ingargiola, Korsh
- 1973
|
|
7
|
An alternate model and solution approach for the long-haul crew pairing problem
– Barnhart, Shenoi
- 1996
|
|
7
|
Subgraph ejection chains and tabu search for the crew scheduling problem
– Cavique, Rego, et al.
- 1999
|
|
7
|
Recent advances in exact optimization of airline scheduling problems
– Rushmeier, Hoffman, et al.
- 1995
|
|
4
|
An algorithm for large-scale zero-one knapsack problems
– Balas, Zemel
- 1980
|
|
4
|
Dynamic Programming and Tight Bounds for the 0-1 Knapsack Problem", Working
– Martello, Pisinger, et al.
- 1997
|
|
3
|
Approximation algorithm to solve real-life multicriteria cutting stock problems
– Chu, Antonio
- 1999
|
|
3
|
Reference manual and user manual. V4.4
– Solver
- 1999
|
|
3
|
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
– Martello, Toth
- 1993
|
|
1
|
Improving the branch and bound algorithm for the knapsack problem. Queen's University Research Report
– Hudson
- 1977
|
|
1
|
An improved bound for the 0-1 knapsack problem
– Villela, Bornstein
- 1983
|
|
1
|
Reference manual and user manual. V4.3
– Solver
- 1998
|
|
1
|
Column generation for a scheduling problem with maintenance constraints
– Jacquet-Lagreze, Lebbar
- 1998
|
|
1
|
Airline crew assignment: modeling and optimization. Carmen Report
– Kohl, Karisch
- 1999
|
|
1
|
Executive Summary
– Parrot
- 1997
|
|
1
|
Unifying optimization and constraint satisfaction. Invited talk at IJCAI '99. Slides available at http://ba.gsia.cmu.edu/jnh/ijcai.ppt
– Hooker
|
|
