Polynomial-time separation of enhanced reverse multistar inequalities

DOI10.1016/j.orl.2013.03.001zbMath1286.90017OpenAlexW2054239450MaRDI QIDQ2450623

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

Publication date: 14 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.03.001

zbMATH Keywords

vehicle routingseparation problemmultistar inequalities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items

Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem

Uses Software

• VRP

Cites Work

• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
• A result on projection for the vehicle routing problem
• Multistars, partial multistars and the capacitated vehicle routing problem
• Projection results for vehicle routing
• The balanced billing cycle vehicle routing problem
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route