Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route

DOI10.1002/net.21481zbMath1269.90010OpenAlexW2160312794MaRDI QIDQ5326796

Luís Gouveia, Juan-José Salazar-González, Jorge Riera-Ledesma

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21481

zbMATH Keywords

vehicle routingprojectioncutting plane algorithmsreverse multistar inequalities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (6)

Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem ⋮ Polynomial-time separation of enhanced reverse multistar inequalities ⋮ Exact algorithms for the equitable traveling salesman problem ⋮ Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm

Uses Software

• VRP

Cites Work

• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
• Polyhedral study of the capacitated vehicle routing problem
• A result on projection for the vehicle routing problem
• Polyhedral results for a vehicle routing problem
• Multistars, partial multistars and the capacitated vehicle routing problem
• Projection results for vehicle routing
• The balanced billing cycle vehicle routing problem
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem

This page was built for publication: Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route