Two routing problems with the limitation of fuel

DOI10.1016/0166-218X(83)90103-8zbMath0508.90086MaRDI QIDQ1838427

Tetsuo Ichimori, Hiroaki Ishii, Toshio Nishida

Publication date: 1983

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

computational complexityroutingpolynomial solvabilitytraffic networkNP- completenessefficient solution procedurelimitation of fuel

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

The electric location routing problem with time windows and partial recharging, A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation

Cites Work

• A note on two problems in connexion with graphs
• ROUTING A VEHICLE WITH THE LIMITATION OF FUEL
• Unnamed Item
• Unnamed Item