Polynomial-time separation of enhanced reverse multistar inequalities

DOI10.1016/J.ORL.2013.03.001MaRDI QIDQ2450623zbMATH OpenOpenAlexFDO

Authors Luis 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) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)

Recommendations

• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
• The separation problem of rounded capacity inequalities: some polynomial cases
• Multistars, partial multistars and the capacitated vehicle routing problem
• Multistars and directed flow formulations
• On the complexity of the separation problem for rounded capacity inequalities

Cites work

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

Cited in

(4)

• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
• The separation problem of rounded capacity inequalities: some polynomial cases
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Polynomial-time separation of enhanced reverse multistar inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450623)