The capacitated plant location problem
From MaRDI portal
Publication:1390274
DOI10.1016/0377-2217(95)00042-OzbMath0914.90180OpenAlexW2091555994MaRDI QIDQ1390274
Publication date: 14 July 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00042-o
Lagrangian relaxationbranch-and-boundLagrangian heuristicvariable splittingcapacitated plant location
Related Items
A cross decomposition algorithm for a multiproduct-multitype facility location problem, Efficient reformulations for dynamic lot-sizing problems with product substitution, A facility location model for logistics systems including reverse flows: the case of remanufacturing activities, Sustainable capacitated facility location/network design problem: a non-dominated sorting genetic algorithm based multiobjective approach, An integrated model for site selection and space determination of warehouses, Location and layout planning. A survey, A Binary Variable Model for Affinity Propagation, The single period coverage facility location problem: Lagrangean heuristic and column generation approaches, Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses, The design of reverse distribution networks: Models and solution procedures, Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities, A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution., Incorporating cellular manufacturing into supply chain design, Research challenges in environmental management, Multi-period capacitated location with modular equipments, Introduction of an underground waste container system-model and solution approaches, RAMP algorithms for the capacitated facility location problem, The stochastic capacitated branch restructuring problem, A dynamic location problem with maximum decreasing capacities, Star \(p\)-hub median problem with modular arc capacities, Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths, Polyhedral results for the precedence-constrained knapsack problem, A capacitated facility location problem with constrained backlogging probabilities, Facility location models for distribution system design, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, Capacity planning with congestion effects, Capacitated facility location problem with general setup cost, On the capacitated concentrator location problem: a reformulation by discretization, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, NAFTA supply chains: facilities location and logistics, Integrated design and operation of remnant inventory supply chains under uncertainty, Capacitated location model with online demand pooling in a multi-channel supply chain, A fast exact method for the capacitated facility location problem with differentiable convex production costs, Towards optimizing the deployment of optical access networks, Lagrangean heuristics for location problems, A genetic algorithm for a single product network design model with lead time and safety stock considerations, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, Modeling and solving a logging camp location problem, Facility location and supply chain management. A review, Models for the schedule optimization problem at a public transit terminal, A Game Theoretic Model for the Optimal Location of Integrated Air Defense System Missile Batteries, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, A model and methodologies for the location problem with logistical components, A comparison of heuristics and relaxations for the capacitated plant location problem
Cites Work
- Unnamed Item
- 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
- Heuristics for the capacitated plant location model
- ADD-heuristics' starting procedures for capacitated plant location models
- A cost operator approach to multistage location-allocation
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- A direct dual method for the mixed plant location problem with some side constraints
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Location-Allocation Problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- Linear Relaxations of the Capacitated Warehouse Location Problem
- A Dual-Based Procedure for Dynamic Facility Location
- An efficient heuristic procedure for the capacitated warehouse location problem
- Multicommodity Distribution System Design by Benders Decomposition
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An Improved Algorithm for the Capacitated Facility Location Problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- A branch‐bound algorithm for the capacitated facilities location problem
