On the vehicle routing problem with lower bound capacities

zbMATH Open1274.90311MaRDI QIDQ2861522FDOQ2861522

Authors: Luis Gouveia, Juan-José Salazar-González 

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001289

Recommendations

• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
• Projection results for vehicle routing
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• scientific article; zbMATH DE number 3892967
• The Capacitated Arc Routing Problem: Lower bounds

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cites Work

• Title not available (Why is that?)
• Multistars, partial multistars and the capacitated vehicle routing problem
• Title not available (Why is that?)
• A result on projection for the vehicle routing problem
• Projection results for vehicle routing
• Polyhedral results for a vehicle routing problem
• Polyhedral study of the capacitated vehicle routing problem
• A generalization of max flow—min cut

Cited In (19)

• Title not available (Why is that?)
• The pyramidal capacitated vehicle routing problem
• Capacitated vehicle routing problem on line with unsplittable demands
• Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
• Improved bounds for vehicle routing solutions
• The capacitated vehicle routing problem with evidential demands
• Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem
• Capacitated vehicle routing with nonuniform speeds
• Computational Science – ICCS 2005
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
• Capacitated transportation problem with bounds on rim conditions
• Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
• A PTAS for bounded-capacity vehicle routing in planar graphs
• The vehicle routing problem with service level constraints
• A new variant of a vehicle routing problem: Lower and upper bounds
• Bounds and Heuristics for Capacitated Routing Problems
• On a Labeled Vehicle Routing Problem
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route

Uses Software

• VRP

This page was built for publication: On the vehicle routing problem with lower bound capacities

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