The alternating stock size problem and the gasoline puzzle

DOI10.1145/3178539MaRDI QIDQ4554346zbMATHOpenAlexWikidataFDO

Authors Alantha Newman, Heiko Röglin, Johanna Seif

Publication date 13 November 2018

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

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2016/6413/

zbMATH Keywords

approximation algorithmsgasoline puzzlestock-size problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25) Inventory, storage, reservoirs (90B05)

Recommendations

• The alternating stock size problem and the gasoline puzzle
• The stock size problem
• scientific article; zbMATH DE number 1263266
• scientific article; zbMATH DE number 3906215
• Degree-Constrained Network Spanners with Nonconstant Delay

Cited in

(2)

• To Fill or Not to Fill: The Gas Station Problem
• The alternating stock size problem and the gasoline puzzle

This page was built for publication: The alternating stock size problem and the gasoline puzzle

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