Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem

DOI10.1002/net.22183MaRDI QIDQ6180050

Unnamed Author, Konstantin Pavlikov, Niels Christian Petersen

Publication date: 18 January 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

capacitated vehicle routingrounded capacity inequalities

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for the capacitated vehicle routing problem
• An exact solution framework for a broad class of vehicle routing problems
• On the capacitated vehicle routing problem
• On the complexity of the separation problem for rounded capacity inequalities
• New benchmark instances for 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 Truck Dispatching Problem
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem