A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems

DOI10.1287/MNSC.21.2.189zbMATH Open0331.90064OpenAlexW2123361998MaRDI QIDQ4096733FDOQ4096733

Authors: Ralph W. Swain 

Publication date: 1974

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.21.2.189

Mathematics Subject Classification ID

Linear programming (90C05) Applications of mathematical programming (90C90) Integer programming (90C10)

Cited In (16)

• The maximum-capture hierarchical location problem
• On the use of genetic algorithms to solve location problems
• Incorporating waiting time in competitive location models
• A gamma heuristic for the \(p\)-median problem
• An alternating heuristic for medianoid and centroid problems in the plane
• Hierarchical location-allocation models for congested systems
• Efficient primal-dual heuristic for a dynamic location problem
• Practical aspects associated with location planning for maternal and perinatal assistance in Brazil
• A column generation approach for the maximal covering location problem
• Analyses of location-price game on networks with stochastic customer behavior and its heuristic algorithm
• On a class of subadditive duals for the uncapacitated facility location problem
• An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
• Dynamic versions of set covering type public facility location problems
• A comparison of two dual-based procedures for solving the p-median problem
• Cournot-Stackelberg games in competitive delocation
• Load balancing and capacity constraints in a hierarchical location model

This page was built for publication: A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems

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