Tourenplanung für zwei Depots bei offenen Touren

DOI10.1007/BF01721250zbMath0531.90093OpenAlexW1996821033MaRDI QIDQ788646

H.-J. Vaterrodt, U. Eberhard, Christoph A. Schneeweiß

Publication date: 1984

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01721250

zbMATH Keywords

vehicle dispatchingtravelling salesmanmodified saving methodopen-tour-problemstwo depots

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Unnamed Item
• The Truck Dispatching Problem
• Approximate Traveling Salesman Algorithms
• Heuristische Lösungsverfahren für Lieferplanprobleme
• Algorithms for Large-scale Travelling Salesman Problems

This page was built for publication: Tourenplanung für zwei Depots bei offenen Touren