A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
From MaRDI portal
Publication:4096733
DOI10.1287/mnsc.21.2.189zbMath0331.90064OpenAlexW2123361998MaRDI QIDQ4096733
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
Applications of mathematical programming (90C90) Integer programming (90C10) Linear programming (90C05)
Related Items
Efficient primal-dual heuristic for a dynamic location problem, Incorporating waiting time in competitive location models, 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, Cournot-Stackelberg games in competitive delocation, Dynamic versions of set covering type public facility location problems, The maximum-capture hierarchical location problem, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, Load balancing and capacity constraints in a hierarchical location model, Hierarchical location-allocation models for congested systems, Practical aspects associated with location planning for maternal and perinatal assistance in Brazil, On the use of genetic algorithms to solve location problems, A column generation approach for the maximal covering location problem, A gamma heuristic for the \(p\)-median problem, A comparison of two dual-based procedures for solving the p-median problem, An alternating heuristic for medianoid and centroid problems in the plane