An algorithm for optimal shipments with given frequencies
From MaRDI portal
Publication:5687640
DOI<655::AID-NAV4>3.0.CO;2-4 10.1002/(SICI)1520-6750(199608)43:5<655::AID-NAV4>3.0.CO;2-4zbMath0864.90044OpenAlexW1986507738MaRDI QIDQ5687640
Walter Ukovich, Maria Grazia Speranza
Publication date: 16 December 1996
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199608)43:5<655::aid-nav4>3.0.co;2-4
computational complexitytransportationbranch-and-boundNP-hardinventory costcapacitated plant locationsimple plant location
Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)
Related Items
Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem, Analysis of the best double frequency policy in the single link problem with discrete shipping times, Inventory Routing, The inventory-routing problem with transshipment, Industrial aspects and literature survey: Combined inventory management and routing, Minimizing logistic costs in multistage supply chains, Heuristic procedures for a stochastic batch service problem, Synchronization of inventory and transportation under flexible vehicle constraint: A heuristics approach using sliding windows and hierarchical tree structure, Direct shipping logistic planning for a hub‐and‐spoke network with given discrete intershipment times, Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem, The single-node dynamic service scheduling and dispatching problem
