A linear-time algorithm for finding optimal vehicle refueling policies

DOI10.1016/J.ORL.2006.05.003MaRDI QIDQ2467464zbMATH OpenOpenAlexWikidataFDO

Authors Nate Gertsch, Jennifer R. Russell, Shieu-Hong Lin

Publication date 21 January 2008

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2006.05.003

zbMATH Keywords

capacitated lot-sizing problem with inventory bounds

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites work

• A Greedy Algorithm for Capacitated Lot-Sizing Problems
• An O(T²) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Bounded Production and Inventory Models with Piecewise Concave Costs
• Computational Complexity of the Capacitated Lot Size Problem
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Deterministic Production Planning: Algorithms and Complexity
• Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation

Cited in

(8)

• A fast exact algorithm for airplane refueling problem
• An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations
• A fast algorithm for the gas station problem
• A generic model of motor-carrier fuel optimization
• A polynomial-time approximation scheme for the airplane refueling problem
• A branch and price approach for routing and refueling station location model
• Greedy algorithm for local heating problem
• Finding Optimal Refueling Policies in Transportation Networks

This page was built for publication: A linear-time algorithm for finding optimal vehicle refueling policies

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