Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing

DOI10.1007/BF01784983zbMath0713.90041OpenAlexW2031302513MaRDI QIDQ750288

Asa Hallefjord, Jaime Barcelo, Kurt O. Jørnsten, Elena Fernández

Publication date: 1990

Published in: OR Spektrum (Search for Journal in Brave)

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

zbMATH Keywords

capacitated plant locationConstraint generation proceduresfacet-induced inequalitiesLagrangean relaxation heuristic algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (15)

Tight bounds from a path based formulation for the tree of hub location problem ⋮ A novel differential evolution algorithm for binary optimization ⋮ Solving a dynamic facility location problem with partial closing and reopening ⋮ On the exact solution of large-scale simple plant location problems ⋮ Discrete location for bundled demand points ⋮ Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities ⋮ Scatter search for the single source capacitated facility location problem ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ Facility location models for distribution system design ⋮ On the capacitated concentrator location problem: a reformulation by discretization ⋮ A new extended formulation with valid inequalities for the capacitated concentrator location problem ⋮ Lagrangean heuristics for location problems ⋮ Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type ⋮ Some personal views on the current state and the future of locational analysis ⋮ A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem

Cites Work

• Unnamed Item
• Unnamed Item
• A heuristic lagrangean algorithm for the capacitated plant location problem
• Solving capacitated clustering problems
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• Location problems
• Locational analysis
• The simple plant location problem: Survey and synthesis
• Cluster Analysis: An Application of Lagrangian Relaxation
• On a generalized bin-packing problem
• Solving Large-Scale Zero-One Linear Programming Problems
• Valid Linear Inequalities for Fixed Charge Problems
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Dual-Based Procedure for Uncapacitated Facility Location
• Technical Note—A Note on Zero-One Programming
• Facets of the knapsack polytope
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Multivariate Stratified Sampling by Optimization

This page was built for publication: Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing