## Branch-and-price: Column generation for solving huge integer programs (1998)

Venue: | Oper. Res |

Citations: | 252 - 11 self |

### BibTeX

@ARTICLE{Barnhart98branch-and-price:column,

author = {Cynthia Barnhart and Ellis L. Johnson and George L. Nemhauser and Martin W. P. Savelsbergh and Pamela H. Vance},

title = {Branch-and-price: Column generation for solving huge integer programs},

journal = {Oper. Res},

year = {1998}

}

### Years of Citing Articles

### OpenURL

### Abstract

We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branchand-bound tree. We present classes of models for which this approach decomposes the problem, provides tighter LP relaxations, and eliminates symmetry. Wethen discuss computational issues and implementation of column generation, branch-andbound algorithms, including special branching rules and e cient ways to solve the LP relaxation. We also discuss the relationship with Lagrangian duality. 1

### Citations

1140 | Integer and Combinatorial Optimization - Nemhauser, Wolsey - 1988 |

276 |
Decomposition principle for linear programming
- Dantzig, Wolfe
- 1960
(Show Context)
Citation Context ...points of its convex hull, denoted by conv(S ). Since representing a bounded polyhedron by its extreme points is the basic construct of Dantzig-Wolfe decomposition and generalized linear programming [=-=Dantzig and Wolfe, 1960-=-], our column generation approach to integer programming is closely related to Dantzig-Wolfe decomposition and the earlier work on path flows in networks of Ford and Fulkerson [1958]. When S is unboun... |

147 | A new optimization algorithm for the vehicle routing problem with time windows - Desrochers, Desrosiers, et al. - 1992 |

146 | Optimization Theory for Large Systems - Lasdon - 1970 |

142 | Lagrangian Relaxation for Integer programming - Geoffrion - 1974 |

136 | Time constrained routing and scheduling - Desrosiers, Dumans, et al. - 1995 |

128 | The traveling-salesman problem and minimum spanning trees - HELD, KARP - 1971 |

127 | The Traveling Salesman Problem - Jünger, Rinaldi - 1997 |

115 | Validation of subgradient optimization - Held, Wolfe, et al. - 1974 |

112 |
On the facial structure of set packing polyhedra
- Padberg
- 1973
(Show Context)
Citation Context ... the generalized assignment problem. The restricted master problem is a set partitioning problem and a well-known class of valid inequalities for the set partitioning problem are clique inequalities [=-=Padberg 1973-=-], which simply say in linear programming terms that the sum of the variables in the clique cannot exceed one. Now consider the pricing problem after the addition of a clique inequality to the restric... |

83 | Set partitioning: A survey - Balas, Padberg - 1976 |

72 | The pickup and delivery problem with time windows - Dumas, Desrosiers, et al. - 1991 |

72 | An integer programming approach to scheduling - Ryan, Foster - 1981 |

66 | A branch-and-price algorithm for the generalized assignment problem - Savelsbergh - 1997 |

45 | Solving binary cutting stock problems by column generation and branch-and-bound - Vance, Barnhart, et al. - 1994 |

44 | A suggested computation for maximal multi-commodity network flows, Management Science 5 - Fulkerson - 1958 |

43 | A column-generation approach to the urban transit crew scheduling problem - Desrochers, Soumis - 1989 |

40 | Very largescale linear programming: a case study in combining interior point and simplex methods - Bixby, Gregory, et al. - 1992 |

39 | 1985/86): LP-based combinatorial problem solving - Hoffman, Padberg |

38 | Airline crew scheduling: A new formulation and decomposition algorithm - Vance, Barnhart, et al. - 1997 |

32 | Routing with time windows by column generation - Desrosiers, Soumis, et al. - 1984 |

26 | Functional description of MINTO, a Mixed INTeger Optimizer
- Savelsbergh, Nemhauser
- 1995
(Show Context)
Citation Context ...e solving an LP but also allow the embedding of column generation LP solving into a general branch-and-bound structure for solving MIPs. The use of MINTO [Nemhauser, Savelsbergh, and Sigismondi 1994, =-=Savelsbergh and Nemhauser 1993-=-] may reduce the implementation e orts even further. MINTO (Mixed INTeger Optimizer) is based on the belief that to solve large mixed-integer programs e ciently, without having to develop a full-blown... |

25 | Nondifferentiable optimization - Lemaréchal - 1989 |

24 | A column generation algorithm for a ship scheduling problem - Appelgren - 1969 |

22 | A Global Approach to CrewPairing Optimization - Anbil, Johnson, et al. - 1992 |

21 | Decomposition and Column Generation for Integer Programming, These de doctorat en Sciences Appliquees. Universite Catholique de Louvain, Louvain, Belgique - Vanderbeck - 1994 |

17 | Min-cut clustering - Johnson, Mehrotra, et al. - 1993 |

16 | A note on bounding a class of linear programming problems, including cutting stock problems - Farley - 1990 |

16 |
Modelling and strong linear programs for mixed integer programming
- Johnson
- 1989
(Show Context)
Citation Context ...969] observed 25 years ago, it is not that straightforward. There are fundamental difficulties in applying column generation techniques for linear programming in integer programming solution methods [=-=Johnson 1989-=-]. These include: ffl Conventional integer programming branching on variables may not be effective because fixing variables can destroy the structure of the pricing problem. ffl Solving these LPs to o... |

16 | A column generation algorithm for bandwidth packing - Parker, Ryan - 1994 |

14 | Totally balanced and greedy matrices - Hoffman, Kolen, et al. - 1985 |

14 |
Crew Scheduling, Cutting Stock, and Column Generation: Solving Huge Integer Programs
- Vance
- 1993
(Show Context)
Citation Context ... form pairings. The major di culty is the total number of pairings, which grows exponentially with the number of ights. For example, in a typical problem with 253 ights, there are 5,833,004 pairings [=-=Vance 1993-=-]. However, it is possible to represent pairings as paths in a graph, and to evaluate their costs with a multilabel shortest path or dynamic programming algorithm, see Desrochers and Soumis [1989], Ba... |

14 | A column-generation technique for the long-haul crew-assignment problem. In: Optimization in industry 2: Mathematical programming and modeling techniques in practice - Barnhart, Johnson, et al. - 1994 |

13 | Time-indexed formulations for single-machine scheduling problems: column generation - Akker, Hurkens, et al. |

13 | The cutting stock problem and integer rounding - Marcotte - 1985 |

12 | A polyhedral approach to edge coloring - Nemhauser, Park - 1991 |

8 | Nondierentiable optimization - Lemarechal - 1989 |

6 | An improved dual-based algorithm for the generalized assignment problem - Guignard, Rosenwein - 1989 |

5 | An alternative formulation and solution strategy for multicommodity network flow problems - Barnhart, Johnson, et al. - 1995 |

5 | Constrained Graph Partitioning: Decomposition, Polyhedral Structure and Algorithms - Mehrotra - 1992 |

4 |
A Branch-and-Price algorithm for the Pickup and Delivery Problem with time windows
- Sol, Savelsbergh
- 1995
(Show Context)
Citation Context ...ake existing columns with reduced cost equal to zero (at least all basic columns satisfy this requirement) and try to construct columns with a positive reduced cost by performing some simple changes [=-=Sol and Savelsbergh 1994-=-]. Notice the similaritybetween the column management functions performed in branchand-price algorithms and the row management functions performed in branch-and-cut algorithms. 5.3 Alternative bounds ... |

3 | Finding Everett’s Lagrange multipliers by linear programming,Operations Research 14 - Brooks, Geoffrion - 1966 |

3 | Slyke - Stallings, Van - 1994 |

3 | Primal partition programming for block diagonal matrices - Rosen - 1964 |

2 |
Crew Planning at Delta Airlines, presentation at
- Marsten
- 1994
(Show Context)
Citation Context ... giving a better representation of the face. Although no extensive computational tests have been done to investigate the differences, it seems that using interior point methods works somewhat better [=-=Marsten 1994-=-]. 23 6.5 LP solution The computationally most intensive component of a branch-and-price algorithm is the solution of the linear programs, which includes the solution of many pricing problems. Therefo... |

2 | On Integer Programming Decomposition and Ways to Enforce Integrality in the - Vanderbeck - 1995 |

2 | Capacited network design with column generation - Clarke, Gong - 1995 |

2 | An integer programming approach toscheduling - Ryan, Foster - 1981 |

1 | A Column Generation Approach to Graph Coloring. Graduate - Mehrotra, Trick - 1993 |

1 | A Column Generation ApproachtoGraph Coloring. Graduate - Mehrotra, Trick - 1993 |