The Train Delivery Problem - Vehicle Routing Meets Bin Packing
From MaRDI portal
Publication:3075453
DOI10.1007/978-3-642-18318-8_9zbMath1314.68394OpenAlexW1811191388WikidataQ60143023 ScholiaQ60143023MaRDI QIDQ3075453
Shay Mozes, Aparna Das, Claire Mathieu
Publication date: 15 February 2011
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18318-8_9
Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (4)
An AFPTAS for variable sized bin packing with general activation costs ⋮ Complexity of inventory routing problems when routing is easy ⋮ Set Covering with Ordered Replacement: Additive and Multiplicative Gaps ⋮ Unnamed Item
This page was built for publication: The Train Delivery Problem - Vehicle Routing Meets Bin Packing
