Complexity of inventory routing problems when routing is easy

DOI10.1002/net.21908zbMath1526.90002MaRDI QIDQ6068536

Martijn van Ee, Leen Stougie, Maaike Hoogeboom, Annelieke C. Baller

Publication date: 13 November 2023

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

computational complexitydynamic programmingapproximationinventory routingperiodic replenishmentpinwheel scheduling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (3)

Perpetual maintenance of machines with different urgency requirements ⋮ Approximation algorithms for replenishment problems with fixed turnover times ⋮ A 12/7-approximation algorithm for the discrete bamboo garden trimming problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Delivery strategies for blood products supplies
• Computational complexity of uncapacitated multi-echelon production planning problems
• Operational estimators for the length of a traveling salesman tour
• The Euclidean traveling salesman problem is NP-complete
• The dynamic-demand joint replenishment problem with approximated transportation costs
• Industrial aspects and literature survey: Combined inventory management and routing
• Computer-Aided Complexity Classification of Dial-a-Ride Problems
• The Train Delivery Problem - Vehicle Routing Meets Bin Packing
• Inventory Routing
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Matheuristic for the Multivehicle Inventory Routing Problem
• Iterated local search and simulated annealing algorithms for the inventory routing problem
• Formulations for an inventory routing problem
• Reducibility among Combinatorial Problems
• Inventory routing problems: a logistical overview
• Approximation algorithms for replenishment problems with fixed turnover times

This page was built for publication: Complexity of inventory routing problems when routing is easy