Bounds for the general capacitated routing problem
DOI10.1002/NET.3230230304zbMATH Open0778.90079OpenAlexW1975085296MaRDI QIDQ5287450FDOQ5287450
Authors: Klaus Jansen 
Publication date: 5 September 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230230304
Recommendations
heuristicslower boundsroutingvehicle routingworst-case errorcapacitated arc routinggeneral capacitated routing problemtour splitting
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cites Work
Cited In (12)
- On a class of capacitated transshipment problems with bounds on rim conditions
- Tour splitting algorithms for vehicle routing problems
- Title not available (Why is that?)
- Bounds and heuristics for the shortest capacitated paths problem
- On approximate data reduction for the Rural Postman Problem: Theory and experiments
- Constant-factor approximations for capacitated arc routing without triangle inequality
- Capacitated transportation problem with bounds on rim conditions
- Bottleneck capacitated transportation problem with bounds on rim conditions
- New inequalities for the general routing problem
- Routing problems: A bibliography
- Bounds and Heuristics for Capacitated Routing Problems
- The capacitated arc routing problem with intermediate facilities
This page was built for publication: Bounds for the general capacitated routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287450)
