Plant location with minimum inventory

DOI10.1007/BF02680552zbMath0920.90088OpenAlexW1994629867MaRDI QIDQ1290654

Francisco Barahona, David L. Jensen

Publication date: 3 June 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02680552

zbMATH Keywords

Dantzig-Wolfe decompositionsubgradient optimizationinventory costsplant locationminimum cut problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

Production/distribution system design with inventory considerations, Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times, A multi-objective bi-level location planning problem for stone industrial parks, An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem, A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design, A branch-and-price algorithm for capacitated hypergraph vertex separation, Dantzig-Wolfe decomposition for the facility location and production planning problem, Integrated location and inventory planning in service parts logistics with customer-based service levels, The vertex \(k\)-cut problem, A multi-objective chance-constrained network optimal model with random fuzzy coefficients and its application to logistics distribution center location problem, Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows, Lagrangian relaxation for an inventory location problem with periodic inventory control and stochastic capacity constraints, A hybrid Markov process-mathematical programming approach for joint location-inventory problem under supply disruptions, An integrated supply chain problem: a nested Lagrangian relaxation approach, A bi-level programming model and solution algorithm for the location of logistics distribution centers, A blood bank network design problem with integrated facility location, inventory and routing decisions, Decomposition and dynamic cut generation in integer linear programming, Improved approximation algorithms for capacitated facility location problems, Capacitated location model with online demand pooling in a multi-channel supply chain, The importance of freight villages: an implementation in TCDD, Applying queuing approach for a stochastic location-inventory problem with two different mean inventory considerations, Facility location and supply chain management. A review

Uses Software

• ABACUS
• MINTO
• OSL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to ABACUS -- a branch-and-cut system
• MINTO, a Mixed INTeger Optimizer
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Maximal Flow Through a Network
• Decomposition Principle for Linear Programs
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
• A Dual-Based Procedure for Uncapacitated Facility Location
• Fractional vertices, cuts and facets of the simple plant location problem
• A Primal Approach to the Simple Plant Location Problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Validation of subgradient optimization
• On implementing push-relabel method for the maximum flow problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II