The pyramidal capacitated vehicle routing problem

DOI10.1016/j.ejor.2009.11.029zbMath1187.90095OpenAlexW2120386337MaRDI QIDQ2270294

Jens Lysgaard

Publication date: 18 March 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://pure.au.dk/ws/files/7387/L-2008-02.pdf

zbMATH Keywords

branch-and-cut-and-pricepyramidal traveling salesman

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items

Integrated optimization on assortment packing and collaborative shipping for fashion clothing

Uses Software

• VRP
• CVRPSEP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vehicle routing problem. Latest advances and new challenges.
• On the capacitated vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• The Vehicle Routing Problem
• A dual algorithm for the constrained shortest path problem

This page was built for publication: The pyramidal capacitated vehicle routing problem