A computational study for common network design in multi-commodity supply chains

DOI10.1016/j.cor.2013.11.009zbMath1307.90027OpenAlexW2144463094MaRDI QIDQ2257365

Kaike Zhang, Ting Wu

Publication date: 25 February 2015

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.11.009

zbMATH Keywords

cutting planeconic integer programmingintegrated supply chain designpolymatroid cuts

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Related Items (3)

Exploring the evolutionary mechanism of complex supply chain systems using evolving hypergraphs ⋮ Efficient Solution Methods for a General r-Interdiction Median Problem with Fortification ⋮ Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs

Cites Work

• Lifting for conic mixed-integer programming
• Conic mixed-integer rounding cuts
• Incorporating inventory and routing costs in strategic location models
• Designing two-echelon supply networks
• The stochastic location model with risk pooling
• Polymatroids and mean-risk minimization in discrete optimization
• A faster strongly polynomial time algorithm for submodular function minimization
• Facility location and supply chain management. A review
• An inventory-location model: Formulation, solution algorithm and computational results
• Integrated location and two-echelon inventory network design under uncertainty
• Designing the distribution network for an integrated supply chain
• A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems
• Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results
• Capacitated warehouse location model with risk pooling
• Warehouse-Retailer Network Design Problem
• Capacitated Warehouse Location with Concave Costs
• Models for Effective Deployment and Redistribution of Bicycles Within Public Bicycle-Sharing Systems
• Stochastic Transportation-Inventory Network Design Problem
• Matroids and the greedy algorithm

This page was built for publication: A computational study for common network design in multi-commodity supply chains