Finding Optimal Refueling Policies in Transportation Networks

DOI10.1007/978-3-540-68880-8_27zbMath1143.90312OpenAlexW2134752723MaRDI QIDQ3511436

Shieu-Hong Lin

Publication date: 10 July 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68880-8_27

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (1)

A fast algorithm for the gas station problem

Cites Work

• Unnamed Item
• A linear-time algorithm for finding optimal vehicle refueling policies
• To Fill or Not to Fill: The Gas Station Problem
• A generic model of motor-carrier fuel optimization
• Bounded Production and Inventory Models with Piecewise Concave Costs
• Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation

This page was built for publication: Finding Optimal Refueling Policies in Transportation Networks