A model for the capacitated \(p\)-facility location problem in global environments

DOI10.1016/S0305-0548(97)00020-8zbMath0889.90105MaRDI QIDQ1374025

Siddhartha S. Syam

Publication date: 2 December 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxation; capacitated facility location; heuristic solution

Mathematics Subject Classification ID

90B80: Discrete location and assignment

Related Items

A review of agile manufacturing systems, Modeling supplier selection and the use of option contracts for global supply chain design, A computational evaluation of a general branch-and-price framework for capacitated network location problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Cluster Analysis: An Application of Lagrangian Relaxation
• 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
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Technical Note—An Algorithm for the p-Median Problem
• Validation of subgradient optimization
• An Extended Theorem for Location on a Network