Optimal logistics for multiple jeeps

DOI10.1016/S0252-9602(10)60135-XMaRDI QIDQ717332zbMATH OpenFDO

Authors Wenlei Chen, Yiming Ding, Wentao Fan

Publication date 29 September 2011

Published in Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0252-9602(10)60135-X

zbMATH Keywords

dynamic programming principlejeep problemlogistics

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Recommendations

• Multiple jeeps problem with container restriction
• Jeep problems with container restriction
• Gale's Round-Trip Jeep Problem
• A jeep crossing a desert of unknown width
• Publication:4503663

Cited in

(9)

• Multiple jeeps problem with container restriction
• Another exploration problem
• scientific article; zbMATH DE number 1506680 (Why is no real title available?)
• scientific article; zbMATH DE number 861438 (Why is no real title available?)
• scientific article; zbMATH DE number 1440125 (Why is no real title available?)
• A jeep crossing a desert of unknown width
• Jeep problems with container restriction
• Reconsidering the jeep problem or how to transport a birthday present to Salosauna
• Optimal time for multiple jeep problems

This page was built for publication: Optimal logistics for multiple jeeps

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