Approximate solutions to large scale capacitated facility location problems

DOI10.1016/0096-3003(90)90029-3zbMath0707.65042OpenAlexW2038803118MaRDI QIDQ919754

Bala Shetty

Publication date: 1990

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(90)90029-3

zbMATH Keywords

Lagrangian relaxationheuristic algorithmnetwork problemKuehn-Hamburger test problemslarge scale capacitated facility location problemsminimum cost network problemsingle source problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Related Items (9)

Distribution network design for fixed lifetime perishable products: a model and solution approach ⋮ A branch-and-price algorithm for the capacitated facility location problem ⋮ Location of slaughterhouses under economies of scale ⋮ Stochastic facility location with general long-run costs and convex short-run costs ⋮ Facility location models for distribution system design ⋮ A Lagrangean heuristic for the plant location problem with multiple facilities in the same site ⋮ A fast exact method for the capacitated facility location problem with differentiable convex production costs ⋮ A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem ⋮ A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• A heuristic lagrangean algorithm for the capacitated plant location problem
• Heuristics for the capacitated plant location model
• A partial dual algorithm for the capacitated warehouse location problem
• ADD-heuristics' starting procedures for capacitated plant location models
• Facility location models for distribution planning
• 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
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A generalization of Polyak's convergence result for subgradient optimization
• Theory and Application of an Optimizing Procedure for Lock Box Location Analysis
• Inverse Optimization: An Application to the Capacitated Plant Location Problem
• Linear Relaxations of the Capacitated Warehouse Location Problem
• An efficient heuristic procedure for the capacitated warehouse location problem
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• The knapsack problem: A survey
• A branch and bound algorithm for the generalized assignment problem
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• An Improved Algorithm for the Capacitated Facility Location Problem
• Validation of subgradient optimization
• A branch‐bound algorithm for the capacitated facilities location problem

This page was built for publication: Approximate solutions to large scale capacitated facility location problems