A simple greedy algorithm for a class of shuttle transportation problems

DOI10.1007/s11590-009-0126-9zbMath1176.90063OpenAlexW2013517061MaRDI QIDQ732773

Chuanqing Xu, Yu-Jun Zheng, Jin-Yun Xue

Publication date: 15 October 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-009-0126-9

zbMATH Keywords

combinatorial optimizationgreedy algorithmshuttle transportation problems

Mathematics Subject Classification ID

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

Related Items (2)

Algorithm design through the optimization of reuse-based generation ⋮ A problem reduction based approach to discrete optimization algorithm design

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The tridiagonal transportation problem
• Stochastic vehicle routing
• Notes on the Theory of Dynamic Programming—Transportation Models
• Matroids and the greedy algorithm

This page was built for publication: A simple greedy algorithm for a class of shuttle transportation problems