A linear-time algorithm for finding optimal vehicle refueling policies
From MaRDI portal
Publication:2467464
DOI10.1016/J.ORL.2006.05.003zbMATH Open1180.90025OpenAlexW2078256846WikidataQ115038541 ScholiaQ115038541MaRDI QIDQ2467464FDOQ2467464
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
Cites Work
- Deterministic Production Planning: Algorithms and Complexity
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Computational Complexity of the Capacitated Lot Size Problem
- Bounded Production and Inventory Models with Piecewise Concave Costs
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- A Greedy Algorithm for Capacitated Lot-Sizing Problems
Cited In (8)
- Finding Optimal Refueling Policies in Transportation Networks
- An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations
- A generic model of motor-carrier fuel optimization
- Greedy algorithm for local heating problem
- A branch and price approach for routing and refueling station location model
- A fast algorithm for the gas station problem
- A fast exact algorithm for airplane refueling problem
- A polynomial-time approximation scheme for the airplane refueling problem
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)
