A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
From MaRDI portal
Publication:1584797
DOI10.1016/S0377-2217(99)00300-8zbMath0971.90043MaRDI QIDQ1584797
Publication date: 6 November 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (21)
A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers ⋮ A probabilistic model applied to emergency service vehicle location ⋮ A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ A review of congestion models in the location of facilities with immobile servers ⋮ New facets for the two-stage uncapacitated facility location polytope ⋮ A review of hierarchical facility location models ⋮ A scatter search-based heuristic to locate capacitated transshipment points ⋮ Two-stage mean-risk stochastic mixed integer optimization model for location-allocation problems under uncertain environment ⋮ Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem ⋮ Solving the robust two-stage capacitated facility location problem with uncertain transportation costs ⋮ A cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning ⋮ Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany ⋮ An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions ⋮ An effective hybrid approach to the two-stage capacitated facility location problem ⋮ A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations ⋮ Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities ⋮ Multi-level facility location problems ⋮ Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem ⋮ A genetic algorithm for a single product network design model with lead time and safety stock considerations ⋮ Resource-constrained management of heterogeneous assets with stochastic deterioration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using central prices in the decomposition of linear programs
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Approximate solutions to large scale capacitated facility location problems
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Reformulation of capacitated facility location problems: How redundant information can help
- Capacitated facility location: Separation algorithms and computational experience
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- Uncapacitated facility location: General solution procedure and computational experience
- The capacitated plant location problem
- Lagrangean heuristics for location problems
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- An LP-based heuristic for two-stage capacitated facility location 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
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Some facets of the simple plant location polytope
- A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Multicommodity Distribution System Design by Benders Decomposition
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- An Improved Algorithm for the Capacitated Facility Location Problem
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Capacitated Facility Location: Valid Inequalities and Facets
- On the Two-Level Uncapacitated Facility Location Problem
This page was built for publication: A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
