Related references
Note: Only part of the references are listed.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)
Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem
M. Gamst et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2012)
The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics
Guido Perboli et al.
TRANSPORTATION SCIENCE (2011)
A fast heuristic algorithm for the maximum concurrent k-splittable flow problem
Massimiliano Caramia et al.
OPTIMIZATION LETTERS (2010)
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
Mike Hewitt et al.
INFORMS JOURNAL ON COMPUTING (2010)
A capacity scaling heuristic for the multicommodity capacitated network design problem
N. Katayama et al.
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2009)
Service network design with asset management: Formulations and comparative analyses
Jardar Andersen et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2009)
Models for Evaluating and Planning City Logistics Systems
Teodor Gabriel Crainic et al.
TRANSPORTATION SCIENCE (2009)
Models and Tabu Search Metaheuristics for Service Network Design with Asset-Balance Requirements
Michael Berliner Pedersen et al.
TRANSPORTATION SCIENCE (2009)
On the approximation of the single source k-splittable flow problem
Massimiliano Caramia et al.
JOURNAL OF DISCRETE ALGORITHMS (2008)
An exact approach for the maximum concurrent k-splittable flow problem
Massimiliano Caramia et al.
OPTIMIZATION LETTERS (2008)
A survey on benders decomposition applied to fixed-charge network design problems
AM Costa
COMPUTERS & OPERATIONS RESEARCH (2005)
A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
TG Crainic et al.
JOURNAL OF HEURISTICS (2004)
Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design
I Ghamlouche et al.
OPERATIONS RESEARCH (2003)
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
TG Crainic et al.
DISCRETE APPLIED MATHEMATICS (2001)
Service network design in freight transportation
TG Crainic
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2000)
Share Paper
