Dynamic supply chain design with inventory
From MaRDI portal
Publication:2384884
DOI10.1016/j.cor.2006.03.017zbMath1141.90021WikidataQ58217262 ScholiaQ58217262MaRDI QIDQ2384884
Stefan Nickel, Justo Puerto, Yolanda Hinojosa, Jörg Kalcsics, Sebastian Velten
Publication date: 10 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.03.017
90C10: Integer programming
90C46: Optimality conditions and duality in mathematical programming
90B50: Management decision making, including multiple objectives
90B05: Inventory, storage, reservoirs
Related Items
Notation and classification for logistic network design models, Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany, An efficient heuristic approach for a multi-period logistics network redesign problem, The single period coverage facility location problem: Lagrangean heuristic and column generation approaches, A computational comparison of several formulations for the multi-period incremental service facility location problem, The multi-period incremental service facility location problem, Facility location and supply chain management. A review, Distribution systems design with role dependent objectives, An aggregation heuristic for large scale p-median problem, Optimal distribution (re)planning in a centralized multi-stage supply network under conditions of the ripple effect and structure dynamics, Optimal design of capacitated production networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- Facility location models for distribution planning
- Partitioning procedures for solving mixed-variables programming problems
- Parametric uncapacitated facility location
- A multiperiod two-echelon multicommodity capacitated plant location problem
- A branch-and-bound method for multicommodity location with balancing requirements
- Lagrangean heuristics for location problems
- The simple plant location problem: Survey and synthesis
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System
- Validation of subgradient optimization
