Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
From MaRDI portal
Publication:750288
DOI10.1007/BF01784983zbMath0713.90041MaRDI QIDQ750288
Elena Fernández, Asa Hallefjord, Kurt O. Jørnsten, Jaime Barcelo
Publication date: 1990
Published in: OR Spektrum (Search for Journal in Brave)
capacitated plant location; Constraint generation procedures; facet-induced inequalities; Lagrangean relaxation heuristic algorithm
65K05: Numerical mathematical programming methods
90C10: Integer programming
90B80: Discrete location and assignment
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Discrete location for bundled demand points, Facility location models for distribution system design, Tight bounds from a path based formulation for the tree of hub location problem, Scatter search for the single source capacitated facility location problem, On the exact solution of large-scale simple plant location problems, 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, Lagrangean heuristics for location problems, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, A novel differential evolution algorithm for binary optimization, On the capacitated concentrator location problem: a reformulation by discretization
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
