The capacitated plant location problem

DOI10.1016/0377-2217(95)00042-OMaRDI QIDQ1390274zbMATH OpenOpenAlexFDO

Authors D. Massart, M. S. Ramanujan

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

zbMATH Keywords

branch-and-boundcapacitated plant locationLagrangian heuristicLagrangian relaxationvariable splitting

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• The capacity and distance constrained plant location problem
• The capacitated plant location problem with multiple facilities in the same site
• Multiobjective capacitated plant location problem
• The capacity constrained facility location problem
• A capacitated competitive facility location problem
• The ordered capacitated facility location problem
• The plant location problem with discrete capacities and indivisible customers
• Valid inequalities and facets of the capacitated plant location problem
• scientific article; zbMATH DE number 4095174
• scientific article; zbMATH DE number 4202014

Cites work

• A branch‐bound algorithm for the capacitated facilities location problem
• A comparison of heuristics and relaxations for the capacitated plant location problem
• A cost operator approach to multistage location-allocation
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A direct dual method for the mixed plant location problem with some side constraints
• A Dual-Based Procedure for Dynamic Facility Location
• A Dual-Based Procedure for Uncapacitated Facility Location
• ADD-heuristics' starting procedures for capacitated plant location models
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• An efficient heuristic procedure for the capacitated warehouse location problem
• An Improved Algorithm for the Capacitated Facility Location Problem
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Heuristics for the capacitated plant location model
• scientific article; zbMATH DE number 3568354 (Why is no real title available?)
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Linear Relaxations of the Capacitated Warehouse Location Problem
• Location-Allocation Problems
• Multicommodity Distribution System Design by Benders Decomposition

Cited in

(58)

• A genetic algorithm for a single product network design model with lead time and safety stock considerations
• Facility location and supply chain management. A review
• Models for the schedule optimization problem at a public transit terminal
• Polyhedral results for the precedence-constrained knapsack problem
• The return plant location problem: Modelling and resolution
• Location and layout planning. A survey
• The design of reverse distribution networks: Models and solution procedures
• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
• 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
• The plant location problem with discrete capacities and indivisible customers
• Star p-hub center problem and star p-hub median problem with bounded path lengths
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
• Lagrangean heuristics for location problems
• Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
• Research challenges in environmental management
• A fast exact method for the capacitated facility location problem with differentiable convex production costs
• Sustainable capacitated facility location/network design problem: a non-dominated sorting genetic algorithm based multiobjective approach
• Introduction of an underground waste container system-model and solution approaches
• RAMP algorithms for the capacitated facility location problem
• Integrated design and operation of remnant inventory supply chains under uncertainty
• A heuristic preprocessor supported algorithm for the capacitated plant location problem
• A cross decomposition algorithm for a multiproduct-multitype facility location problem
• Efficient reformulations for dynamic lot-sizing problems with product substitution
• Multi-period capacitated location with modular equipments
• Star p-hub median problem with modular arc capacities
• Capacitated facility location problem with general setup cost
• On the capacitated concentrator location problem: a reformulation by discretization
• Towards optimizing the deployment of optical access networks
• A game theoretic model for the optimal location of integrated air defense system missile batteries
• Lagrangean heuristics applied to a variety of large capacitated plant location problems
• An integrated model for site selection and space determination of warehouses
• scientific article; zbMATH DE number 4164539 (Why is no real title available?)
• Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
• Incorporating cellular manufacturing into supply chain design
• scientific article; zbMATH DE number 4095174 (Why is no real title available?)
• scientific article; zbMATH DE number 1271323 (Why is no real title available?)
• A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
• Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
• The stochastic capacitated branch restructuring problem
• A Binary Variable Model for Affinity Propagation
• A capacitated facility location problem with constrained backlogging probabilities
• NAFTA supply chains: facilities location and logistics
• Capacity planning with congestion effects
• The single period coverage facility location problem: Lagrangean heuristic and column generation approaches
• A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
• Investigation of a multi-objective fixed charge transportation problem with quantity dependent transportation cost and discount policy via metaheuristics
• Facility location models for distribution system design
• Modeling and solving a logging camp 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
• A facility location model for logistics systems including reverse flows: the case of remanufacturing activities
• A dynamic location problem with maximum decreasing capacities
• The capacity and distance constrained plant location problem
• Multiobjective capacitated plant location problem
• Equivalent instances of the simple plant location problem
• Capacitated location model with online demand pooling in a multi-channel supply chain

This page was built for publication: The capacitated plant location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1390274)