A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
From MaRDI portal
Publication:1584797
Recommendations
- Lagrangian heuristic for the two-stage capacitated facility location problem
- scientific article; zbMATH DE number 1189254
- An LP-based heuristic for two-stage capacitated facility location problems
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- Applying Lagrangian relaxation to the resolution of two-stage location problems
Cites work
- scientific article; zbMATH DE number 193993 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 711782 (Why is no real title available?)
- scientific article; zbMATH DE number 1062478 (Why is no real title available?)
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
- A heuristic lagrangean algorithm for the capacitated plant location problem
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- An Improved Algorithm for the Capacitated Facility Location Problem
- An LP-based heuristic for two-stage capacitated facility location problems
- Approximate solutions to large scale capacitated facility location problems
- Capacitated Facility Location: Valid Inequalities and Facets
- Capacitated facility location: Separation algorithms and computational experience
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- Lagrangean heuristics for location problems
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Multicommodity Distribution System Design by Benders Decomposition
- On the Two-Level Uncapacitated Facility Location Problem
- Reformulation of capacitated facility location problems: How redundant information can help
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Some facets of the simple plant location polytope
- The capacitated plant location problem
- Uncapacitated facility location: General solution procedure and computational experience
- Using central prices in the decomposition of linear programs
Cited in
(33)- Resource-constrained management of heterogeneous assets with stochastic deterioration
- Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities
- Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem
- Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- New facets for the two-stage uncapacitated facility location polytope
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
- Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning
- An LP-based heuristic for two-stage capacitated facility location problems
- Applying Lagrangian relaxation to the resolution of two-stage location problems
- A probabilistic model applied to emergency service vehicle location
- A scatter search-based heuristic to locate capacitated transshipment points
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- Lagrangian heuristic for the two-stage capacitated facility location problem
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- Lower bounds for the two-stage uncapacitated facility location problem
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
- Two-stage mean-risk stochastic mixed integer optimization model for location-allocation problems under uncertain environment
- Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce
- A review of congestion models in the location of facilities with immobile servers
- Solving the robust two-stage capacitated facility location problem with uncertain transportation costs
- A review of hierarchical facility location models
- Multi-level facility location problems
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- An exact method for the two-echelon, single-source, capacitated facility location problem
- A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
- Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem
- scientific article; zbMATH DE number 1189252 (Why is no real title available?)
- An effective hybrid approach to the two-stage capacitated facility location problem
- A genetic algorithm for a single product network design model with lead time and safety stock considerations
- Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
This page was built for publication: A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584797)
