A note on branch-and-cut-and-price

Authors:
Dominique Feillet;Michel Gendreau;AndréS L. Medaglia;Jose L. Walteros
Affiliations:
Ecole des Mines de Saint-Etienne, CMP Georges Charpak, F-13541 Gardanne, France;CIRRELT and MAGI, ícole Polytechnique, C.P. 6079, succ. Centre-ville, Montréal, Canada H3C 3A7;Departamento de Ingeniería Industrial, Universidad de Los Andes, Bogotá, Colombia;Departamento de Ingeniería Industrial, Universidad de Los Andes, Bogotá, Colombia
Venue:
Operations Research Letters
Year:
2010

Citing 7
Cited 1

A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
Solving airline crew scheduling problems by branch-and-cut

Management Science
Using Extra Dual Cuts to Accelerate Column Generation

INFORMS Journal on Computing
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
Selected Topics in Column Generation

Operations Research
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem

Computers and Operations Research
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement

Discrete Optimization

On an exact method for the constrained shortest path problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a methodology for branch-and-cut-and-price when cuts and columns are generated simultaneously. The methodology is illustrated with two application cases: the Split Delivery Vehicle Routing Problem (SDVRP) and the Bus Rapid Transit Route Design Problem (BRTRDP).