Related references
Note: Only part of the references are listed.An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
Guillaume Marques et al.
COMPUTERS & OPERATIONS RESEARCH (2020)
Exact Branch-Price-and-Cut Algorithms for Vehicle Routing
Luciano Costa et al.
TRANSPORTATION SCIENCE (2019)
Branch-and-Price-Based Algorithms for the Two-Echelon Vehicle Routing Problem with Time Windows
Nico Dellaert et al.
TRANSPORTATION SCIENCE (2019)
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
A. Pessoa et al.
INFORMS JOURNAL ON COMPUTING (2018)
A large neighbourhood based heuristic for two-echelon routing problems
U. Breunig et al.
COMPUTERS & OPERATIONS RESEARCH (2016)
Intermediate Facilities in Freight Transportation Planning: A Survey
G. Guastaroba et al.
TRANSPORTATION SCIENCE (2016)
City Logistics: Challenges and Opportunities
Martin Savelsbergh et al.
TRANSPORTATION SCIENCE (2016)
Dual Inequalities for Stabilized Column Generation Revisited
Timo Gschwind et al.
INFORMS JOURNAL ON COMPUTING (2016)
A survey on two-echelon routing problems
R. Cuda et al.
COMPUTERS & OPERATIONS RESEARCH (2015)
Reaching the Elementary Lower Bound in the Vehicle Routing Problem with Time Windows
Claudio Contardo et al.
NETWORKS (2015)
A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
Fernando Afonso Santos et al.
TRANSPORTATION SCIENCE (2015)
New developments in the primal-dual column generation technique
Jacek Gondzio et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2013)
An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
Roberto Baldacci et al.
OPERATIONS RESEARCH (2013)
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem
Mads Jepsen et al.
TRANSPORTATION SCIENCE (2013)
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics
Vera C. Hemmelmayr et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
Cutting Planes for Branch-and-Price Algorithms
Guy Desaulniers et al.
NETWORKS (2011)
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
Roberto Baldacci et al.
OPERATIONS RESEARCH (2011)
The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics
Guido Perboli et al.
TRANSPORTATION SCIENCE (2011)
Models for Evaluating and Planning City Logistics Systems
Teodor Gabriel Crainic et al.
TRANSPORTATION SCIENCE (2009)
New dynamic programming algorithms for the resource constrained elementary shortest path problem
Giovanni Righini et al.
NETWORKS (2008)
Subset-row inequalities applied to the vehicle-routing problem with time windows
Mads Jepsen et al.
OPERATIONS RESEARCH (2008)
Interior point stabilization for column generation
Louis-Martin Rousseau et al.
OPERATIONS RESEARCH LETTERS (2007)
Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
Amar Oukil et al.
COMPUTERS & OPERATIONS RESEARCH (2007)
Dual-optimal inequalities for stabilized column generation
Hatem Ben Amor et al.
OPERATIONS RESEARCH (2006)
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
N Boland et al.
OPERATIONS RESEARCH LETTERS (2006)
Selected topics in column generation
ME Lübbecke et al.
OPERATIONS RESEARCH (2005)
Advanced freight transportation systems for congested urban areas
TG Crainic et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2004)
A new branch-and-cut algorithm for the capacitated vehicle routing problem
J Lysgaard et al.
MATHEMATICAL PROGRAMMING (2004)
Share Paper
