State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
From MaRDI portal
Publication:3659494
DOI10.1287/mnsc.29.4.498zbMath0513.90023OpenAlexW1975391495MaRDI QIDQ3659494
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.498
logisticsmultiple objectivestree networkmutual communicationdistance constraints problemlocation of pathsminimax and minisum location problems
Programming involving graphs or networks (90C35) Inventory, storage, reservoirs (90B05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Location-allocation on congested networks ⋮ Application of facility location modeling constructs to vendor selection problems ⋮ On the set partitioning type formulation for the discrete location problem ⋮ Hard cases of the multifacility location problem ⋮ The \(k\)-neighbor, \(r\)-domination problems on interval graphs ⋮ Resource allocation among competing activities: A lexicographic minimax approach ⋮ On condorcet and median points of simple rectilinear polygons ⋮ The location of central structures in trees ⋮ A heuristic for the p-center problem in graphs ⋮ A multi-objective model for locating search and rescue boats ⋮ Multiobjective analysis of facility location decisions ⋮ One more well-solved case of the multifacility location problem ⋮ Double bound method for solving the \(p\)-center location problem ⋮ Location and layout planning. A survey ⋮ Analytical models for locating undesirable facilities ⋮ A multifacility location problem on median spaces ⋮ Covering, Packing and Generalized Perfection ⋮ Configuration‐based approach for topological problems in the design of wireless sensor networks ⋮ Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees ⋮ Accretion centers: A generalization of branch weight centroids ⋮ Sequential competitive location on networks ⋮ The discrete p-dispersion problem ⋮ Median problem in some plane triangulations and quadrangulations. ⋮ Locational analysis ⋮ Kinetic Maintenance of Mobile k-Centres on Trees ⋮ Location routing problems on trees ⋮ Minisum amd minimax paths of a moving facility on a network ⋮ The median game ⋮ L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem ⋮ An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies ⋮ The algorithmic use of hypertree structure and maximum neighbourhood orderings ⋮ An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree ⋮ Unnamed Item ⋮ The β-reliable minimax and maximin location problems on a network with probabilistic weights ⋮ The maximum absolute deviation measure in location problems on networks ⋮ Discrete Convex Functions on Graphs and Their Algorithmic Applications ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ Minimum 0-extension problems on directed metrics ⋮ Efficient algorithms for two generalized 2-median problems and the group median problem on trees ⋮ Lagrangean heuristics for location problems ⋮ Group centre and group median of a tree ⋮ Strategic facility location: A review ⋮ The stochastic \(p\)-median problem with unknown cost probability distribution ⋮ A hybrid data mining metaheuristic for the p‐median problem ⋮ Locating an absolute center on graphs that are almost trees ⋮ Competitive location on networks under delivered pricing ⋮ Kinetic maintenance of mobile \(k\)-centres on trees ⋮ An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs ⋮ Some new algorithms for location problems on networks ⋮ Tight spans of distances and the dual fractionality of undirected multiflow problems ⋮ A characterization of minimizable metrics in the multifacility location problem ⋮ Median Problems in Networks ⋮ Exploiting Structure: Location Problems on Trees and Treelike Graphs ⋮ Unnamed Item ⋮ Pendant-medians ⋮ Networks with Condorcet solutions ⋮ The dynamics and internal geometry of the three-city noxious location problem ⋮ Location problems ⋮ Heuristics for the p-hub location problem ⋮ Integer programming formulations of discrete hub location problems ⋮ The k-neighbor domination problem ⋮ Location of central nodes in time varying computer networks ⋮ A linear-time algorithm for solving the center problem on weighted cactus graphs ⋮ Computing a median point of a simple rectilinear polygon
