To Fill or Not to Fill: The Gas Station Problem
From MaRDI portal
Publication:3527241
DOI10.1007/978-3-540-75520-3_48zbMath1151.90570OpenAlexW2101097294MaRDI QIDQ3527241
Samir Khuller, Julián Mestre, Azarakhsh Malekian
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_48
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)
Related Items (4)
A branch and price approach for routing and refueling station location model ⋮ Finding Optimal Refueling Policies in Transportation Networks ⋮ The locomotive fleet fueling problem ⋮ Heuristics for routing heterogeneous unmanned vehicles with fuel constraints
This page was built for publication: To Fill or Not to Fill: The Gas Station Problem
