State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
From MaRDI portal
Publication:3659493
DOI10.1287/mnsc.29.4.482zbMath0513.90022OpenAlexW2043869641MaRDI QIDQ3659493
Timothy J. Lowe, Barbaros C. Tansel, Richard L. Francis
Publication date: 1983
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.29.4.482
Inventory, storage, reservoirs (90B05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (75)
Medians in median graphs and their cube complexes in linear time ⋮ A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran ⋮ Application of facility location modeling constructs to vendor selection problems ⋮ Optimum positioning of moving service facility ⋮ Approximation algorithms for orthogonal line centers ⋮ On the set partitioning type formulation for the discrete location problem ⋮ Upgrading trees under diameter and budget constraints ⋮ The \(w\)-centroids and least \(w\)-central subtrees in weighted trees ⋮ Efficient algorithms for centers and medians in interval and circular-arc graphs ⋮ A scalable exact algorithm for the vertex \(p\)-center problem ⋮ Mixed planar/network facility location problems ⋮ Making a state-of-the-art heuristic faster with data mining ⋮ The network \(p\)-median problem with discrete probabilistic demand weights ⋮ The location of central structures in trees ⋮ A heuristic for the p-center problem in graphs ⋮ Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem ⋮ A multi-objective model for locating search and rescue boats ⋮ Multiobjective analysis of facility location decisions ⋮ Siting park-and-ride facilities using a multi-objective spatial optimization model ⋮ Trees with unique least central subtrees ⋮ The general facility location problem with connectivity on trees ⋮ Double bound method for solving the \(p\)-center location problem ⋮ Approximating the Restricted 1-Center in Graphs ⋮ A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs ⋮ An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths ⋮ The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic ⋮ An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs ⋮ Discrete parallel machine makespan ScheLoc problem ⋮ On Solving a Class of Continuous Traffic Equilibrium Problems and Planning Facility Location Under Congestion ⋮ On tight spans for directed distances ⋮ Comments on ‘Facility location problem on network under multiple criteria fuzzy set theoretic approach’ ⋮ Approximability results for the $p$-centdian and the converse centdian problems ⋮ Configuration‐based approach for topological problems in the design of wireless sensor networks ⋮ Graphs with \(G^p\)-connected medians ⋮ Approximability results for the converse connectedp-centre problem† ⋮ Approximating the restricted 1-center in graphs ⋮ Mind the gap: edge facility location problems in theory and practice ⋮ The connected \(p\)-center problem on block graphs with forbidden vertices ⋮ A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives ⋮ Facility location for large-scale emergencies ⋮ Finding a central vertex in an HHD-free graph ⋮ Sequential competitive location on networks ⋮ Balanced location on a graph ⋮ Kinetic Maintenance of Mobile k-Centres on Trees ⋮ Location routing problems on trees ⋮ Minisum amd minimax paths of a moving facility on a network ⋮ Approximation algorithms for orthogonal line centers ⋮ The median game ⋮ Robust location problems with pos/neg weights on a tree ⋮ An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies ⋮ On worst-case aggregation analysis for network location problems ⋮ Confined location of facilities on a graph ⋮ Probabilistic stopping rules for GRASP heuristics and extensions ⋮ The maximum absolute deviation measure in location problems on networks ⋮ A fractional model for locating semi-desirable facilities on networks ⋮ Reliable distribution networks design with nonlinear fortification function ⋮ Design of a reliable logistics network with hub disruption under uncertainty ⋮ Lagrangean heuristics for location problems ⋮ Strategic facility location: A review ⋮ Strongly polynomial-time truthful mechanisms in one shot ⋮ Distance Domination in Graphs ⋮ Kinetic maintenance of mobile \(k\)-centres on trees ⋮ An efficient tabu search procedure for the \(p\)-median problem ⋮ Some new algorithms for location problems on networks ⋮ Risk-balanced territory design optimization for a micro finance institution ⋮ The support unit location problem to road traffic surveys with multi-stages ⋮ Median Problems in Networks ⋮ Unnamed Item ⋮ Location problems ⋮ ADD-heuristics' starting procedures for capacitated plant location models ⋮ The zone-constrained location problem on a network ⋮ Unnamed Item ⋮ Location of central nodes in time varying computer networks ⋮ An efficient noisy binary search in graphs via Median approximation ⋮ Metaheuristic applications on discrete facility location problems: a survey
This page was built for publication: State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
