To fill or not to fill, the gas station problem

DOI10.1145/1978782.1978791MaRDI QIDQ3189019zbMATH OpenOpenAlexWikidataFDO

Authors Samir Khuller, Azarakhsh Malekian, Julián Mestre

Publication date 9 September 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1978782.1978791

zbMATH Keywords

approximation algorithmsgraph theoryshortest pathsvehicle routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• To Fill or Not to Fill: The Gas Station Problem
• A fast algorithm for the gas station problem
• Finding Optimal Refueling Policies in Transportation Networks
• scientific article; zbMATH DE number 3845637
• Routing vehicles to minimize fuel consumption

Cited in

(11)

• A fast algorithm for the gas station problem
• Efficient and equitable transnational infrastructure planning for natural gas trucking in the European union
• Vehicle routing with subtours
• Efficient algorithms for ride-hitching in UAV travelling
• Online ride-hitching in UAV travelling
• Optimal routing and charging of energy-limited vehicles in traffic networks
• Finding Optimal Refueling Policies in Transportation Networks
• To Fill or Not to Fill: The Gas Station Problem
• A generic model of motor-carrier fuel optimization
• New approximation algorithms for the rooted budgeted cycle cover problem
• New approximation algorithms for the rooted budgeted cycle cover problem

This page was built for publication: To fill or not to fill, the gas station problem

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