Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
From MaRDI portal
Publication:5735194
DOI10.1287/opre.12.3.450zbMath0123.00305OpenAlexW2102750402WikidataQ61248967 ScholiaQ61248967MaRDI QIDQ5735194
Publication date: 1964
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.12.3.450
Related Items
A maritime search and rescue location analysis considering multiple criteria, with simulated demand, Unnamed Item, An efficient algorithm for solving the median problem on real road networks, Discrete equal-capacityp-median problem, Some problems in discrete optimization, Discrete facility location in machine learning, Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights, Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter, Capacity expansion strategies for electric vehicle charging networks: Model, algorithms, and case study, A two‐tier urban delivery network with robot‐based deliveries, A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem, Identifying trade‐offs in equity and efficiency for simultaneously optimizing location and multipriority dispatch of ambulances, Constraint relaxation for the discrete ordered median problem, Efficient algorithms for finding <scp>2‐medians</scp> of a tree, Unimodal eccentricity in trees, Configuration‐based approach for topological problems in the design of wireless sensor networks, A parallel variable neighborhood search approach for the obnoxious p‐median problem, Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities, Location analysis of primary health care centers: a case study of Mohalla clinics in Delhi, Location Science in Canada, A trajectory based heuristic for the planar \(p\)-median problem, Location-allocation analysis of humanitarian distribution plans: a case of united nations humanitarian response depots, Graphs with \(G^p\)-connected medians, Change of scene: the geographic dynamics of resilience to vehicular accidents, Unnamed Item, An efficient Benders decomposition for the \(p\)-median problem, Graph burning and non-uniform \(k\)-centers for small treewidth, Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm, Unnamed Item, Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location, Ambulance Emergency Response Optimization in Developing Countries, Small Space Stream Summary for Matroid Center, Unnamed Item, Comparison of \(\alpha\)-Condorcet points with median and center locations, The generalized \(p\)-centdian on network, Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game, The backup 2‐center and backup 2‐median problems on trees, A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands, Unnamed Item, A fractional model for locating semi-desirable facilities on networks, Affinity propagation and uncapacitated facility location problems, Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks, Delay-constrained minimum shortest path trees and related problems, Delay-constrained minimum shortest path trees and related problems, Fast approximation of eccentricities and distances in hyperbolic graphs, Generalized Center Problems with Outliers, Allocating servers to facilities, when demand is elastic to travel and waiting times, A historical perspective on location problems, The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique, Unnamed Item, Optimal algorithms for selective variants of the classical and inverse median location problems on trees, A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location, The support unit location problem to road traffic surveys with multi-stages, Median Problems in Networks, Discrete Center Problems, Covering Problems, The Location of Undesirable Facilities, Stochastic Analysis in Location Research, Exploiting Structure: Location Problems on Trees and Treelike Graphs, Heuristics for Location Models, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems, A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran, On statistical bounds of heuristic solutions to location problems, The stochastic \(p\)-hub center problem with service-level constraints, A reliable budget-constrained FL/ND problem with unreliable facilities, Flow intercepting facility location: Problems, models and heuristics, Proximity, remoteness and distance eigenvalues of a graph, Location and reorganization problems: the Calabrian health care system case, Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem, Democratic elections and centralized decisions: Condorcet and approval voting compared with median and coverage locations, A multi-objective model for locating search and rescue boats, The general facility location problem with connectivity on trees, Double bound method for solving the \(p\)-center location problem, Protection issues for supply systems involving random attacks, Dominance rules for the optimal placement of a finite-size facility in an existing layout, Optimal shift partitioning of pharmacies, A new heuristic for solving the \(p\)-median problem in the plane, On solving large instances of the capacitated facility location problem, A mixed integer nonlinear programming model and heuristic solutions for location, inventory and pricing decisions in a closed loop supply chain, The transfer point location problem, A polynomial algorithm for the multicriteria cent-dian location problem, The gravity \(p\)-median model, A distribution map for the one-median location problem on a network, An \(O(mn)\) algorithm for the anti-cent-dian problem, Hierarchical location-allocation problems: A classification scheme, An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths, Equity models in planar location, Median problems with positive and negative weights on cycles and cacti, The multi-facility median problem with Pos/Neg weights on general graphs, The gravity multiple server location problem, Bounded-degree minimum-radius spanning trees in wireless sensor networks, Some results on approximate 1-median selection in metric spaces, Bee colony optimization for the \(p\)-center problem, A decomposition approach for facility location and relocation problem with uncertain number of future facilities, A new fuzzy weighted average (FWA) method based on left and right scores: an application for determining a suitable location for a gas oil station, Relocation-promotion problem with Euclidean distance, Uncertain models for single facility location problems on networks, A method for solving to optimality uncapacitated location problems, The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem, Comparative error bound theory for three location models: continuous demand versus discrete demand, Marginal analysis for the fuzzy \(p\)-median problem, Network search games with immobile hider, without a designated searcher starting point, Locating optimal timetables and vehicle schedules in a transit line, Data aggregation for \(p\)-median problems, A heuristic approach to solve the preventive health care problem with budget and congestion constraints, Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks, Threshold robustness in discrete facility location problems: a bi-objective approach, Facility location in normed linear spaces, On the minimum diameter spanning tree problem, Optimal partitioning of a data set based on the \(p\)-median model, An effective heuristic for the \(P\)-median problem with application to ambulance location, Sequential location of two facilities: comparing random to optimal location of the first facility, A parallelized lagrangean relaxation approach for the discrete ordered median problem, Maximizing the minimum cover probability by emergency facilities, Planning sustainable community health schemes in rural areas of developing countries, A note on a stochastic location problem, Improving the location of minisum facilities through network modification, A center location problem with congestion, Location and allocation for distribution systems with transshipments and transportion economies of scale, Forecast horizons and dynamic facility location planning, On worst-case aggregation analysis for network location problems, A network location-allocation model trading off flow capturing and \(p\)- median objectives, The multi-facility location-allocation problem with polyhedral barriers, The heuristic concentration-integer and its application to a class of location problems, Network location of a reliable center using the most reliable route policy, A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network, Inverse \(p\)-median problems with variable edge lengths, A large class of facets for the \(K\)-median polytope, On the structure of the solution set for the single facility location problem with average distances, Multi-facility ordered median problems in directed networks, Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice, Facility location models for distribution system design, Centrality measure in graphs, Metrics and barycenters for point pattern data, The probabilistic gradual covering location problem on a network with discrete random demand weights, The minisum location problem on an undirected network with continuous link demands, Multiobjective optimization for multimode transportation problems, Optimizing the location of a production firm, Center location problems on tree graphs with subtree-shaped customers, Facility placement with sub-aisle design in an existing layout, Confidence in heuristic solutions?, Competitive location on networks under delivered pricing, The continuous center set of a network, Asymmetric distances, semidirected networks and majority in Fermat-Weber problems, Aggregation error for location models: Survey and analysis, Optimal algorithms for the path/tree-shaped facility location problems in trees, Robust placement of sensors in dynamic water distribution systems, US coast guard air station location with respect to distress calls: a spatial statistics and optimization based methodology, The \(p\)-median problem in fuzzy environment: proving fuzzy vertex optimality theorem and its application, The absolute centre of a graph, Pendant-medians, Outcomes of voting and planning in single facility location problems, The zone-constrained location problem on a network, Location of central nodes in time varying computer networks, On the exponential cardinality of FDS for the ordered \(p\)-median problem, Enhancements to two exact algorithms for solving the vertex \(P\)-center problem, The stochastic location-assignment problem on a tree, Filtering policies in loss queueing network location problems, Location of service facilities for the elderly, A genetic algorithm approach for regrouping service sites, An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem, Medians in median graphs and their cube complexes in linear time, Medians for weight metrics in the covering graphs of semilattices, The median tour and maximal covering tour problems: Formulations and heuristics, A modular capacitated multi-objective model for locating maritime search and rescue vessels, A bi-objective approach to discrete cost-bottleneck location problems, How bad can a voting locating be, Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions, Implementing a mathematical model for locating EMS vehicles in Fayetteville, NC, Locating an n-server facility in a stochastic environment, Finding the two-core of a tree, Most and least uniform spanning trees, The \(p\)-arborescence star problem: formulations and exact solution approaches, A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks, Optimal M/G/1 server location on a tree network with continuous link demands, The \(w\)-centroids and least \(w\)-central subtrees in weighted trees, Linearization technique with superior expressions for centralized planning problem with discount policy, A scalable exact algorithm for the vertex \(p\)-center problem, A heuristic for the p-center problem in graphs, On the accuracy of demand point solutions to the planar, Manhattan metric, p-median problem, with and without barriers to travel, On optimal realizations of finite metric spaces by graphs, Sustainable capacitated facility location/network design problem: a non-dominated sorting genetic algorithm based multiobjective approach, Trees with unique least central subtrees, Bi-objective vibration damping optimization for congested location-pricing problem, The Weber obnoxious facility location model: a big arc small arc approach, Asymptotic approach to the problem of \(k\)-median of a graph, A large neighborhood search heuristic for supply chain network design, Location and layout planning. A survey, The earliest contribution to location theory? Spatio-economic equilibrium with Lamé and Clapeyron, 1829, A queueing-location model with expected service time dependent queueing disciplines, Group centre and group median of a network, The biobjective absolute center problem, A biased random-key genetic algorithm for the tree of hubs location problem, General network design: a unified view of combined location and network design problems, An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs, Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem, A linear algorithm for the pos/neg-weighted 1-median problem on a cactus, Developments in network location with mobile and congested facilities, Does Euclidean distance work well when the \(p\)-median model is applied in rural areas?, The stochastic interdiction median problem with disruption intensity levels, Accretion centers: A generalization of branch weight centroids, Budget constrained location problem with opening and closing of facilities., Algorithms for the m-center problems: A survey, Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem, Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm, Fuzzy location problems on networks., Modelling and solving central cycle problems with integer programming., On locating new facilities in a competitive environment, Locational analysis, GRASP and VNS for solving the \(p\)-next center problem, An algorithm to evaluate public transportation stops for minimizing passenger walking distance, An algorithm for finding the absolute center of a network, OR models in urban service facility location: a critical review of applications and future developments, The incremental cooperative design of preventive healthcare networks, Optimization of competitive facility location for chain stores, On a general network location--production--allocation problem, Median and covering location problems with interconnected facilities, Classical and inverse median location problems under uncertain environment, An analysis of \(p\)-median location problem: effects of backup service level and demand assignment policy, Effects of multipurpose shopping trips on retail store location in a duopoly, Location of facility based on simulated annealing and ``ZKW algorithms, An optimal method for solving the (generalized) multi-Weber problem, Multi-level facility location problems, An aggregation heuristic for large scale p-median problem, Location analysis: a synthesis and survey, Proximity, remoteness and girth in graphs, A combined facility location and network design problem with multi-type of capacitated links, Another characterization of the centroid of a tree, Strategic facility location: A review, A gamma heuristic for the \(p\)-median problem, Efficient parallel algorithms for r-dominating set and p-center problems on trees, Locating an absolute center on graphs that are almost trees, Dominant, an algorithm for the \(p\)-center problem., Locating flow-capturing units on a network with multi-counting and diminishing returns to scale, An efficient tabu search procedure for the \(p\)-median problem, Heuristic concentration: Two stage solution construction, Locational optimization problems solved through Voronoi diagrams, A dynamic programming heuristic for the \(P\)-median problem, Partial and perfect path covers of cographs, Discretization results for the Huff and Pareto-Huff competitive location models on networks, Use of location-allocation models in health service development planning in developing nations, Heuristic concentration and tabu search: A head to head comparison, Some new algorithms for location problems on networks, The capacitated multiple allocation hub location problem: Formulations and algorithms, Network distance characteristics that affect computational effort in \(p\)-median location problems, Infrastructure development for conversion to environmentally friendly fuel, Store location with multipurpose shopping trips and a new random utility customers' choice model, Minimizing the sum of the \(k\) largest functions in linear time., Some minimax problems for graphs, Locating service centers with precedence constraints, Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty, Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants, Analyzing tradeoffs between zonal constraints and accessibility in facility location, Integer programming formulations of discrete hub location problems, Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree, A linear-time algorithm for solving the center problem on weighted cactus graphs, 'Multidimensional' extensions and a nested dual approach for the m-median problem, An efficient noisy binary search in graphs via Median approximation, Center problems with pos/neg weights on trees, An exact algorithm for the fuzzy p-median problem, Production and location on a network under demand uncertainty, Single Facility $l_p $-Distance Minimax Location, Competitive location on a network, Biobjective center – balance graph location model*, Worst-case incremental analysis for a class ofp-facility location problems, Efficient algorithms for centers and medians in interval and circular-arc graphs, A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm, Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach, A new method for location selection: A hybrid analysis, An extended covering model for flexible discrete and equity location problems, The network \(p\)-median problem with discrete probabilistic demand weights, Unreliable point facility location problems on networks, Capacitated, balanced, sequential location-allocation problems on chains and trees, Multiobjective analysis of facility location decisions, LINEAR PROGRAMMING AND RECURRENT ASSOCIATIVE MEMORIES, Fuzzy facility location-allocation problem under the Hurwicz criterion, Network search games, with arbitrary searcher starting point, A bibliography for some fundamental problem categories in discrete location science, BEAMR: an exact and approximate model for the \(p\)-median problem, Siting park-and-ride facilities using a multi-objective spatial optimization model, Linear programming and simple associative memories, Approximating the Restricted 1-Center in Graphs, Probabilistic programming models for traffic incident management operations planning, Multi-criteria decision analysis for efficient location-allocation problem combining DEA and goal programming, A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs, The min-p robust optimization approach for facility location problem under uncertainty, A survey of sequences of central subgraphs, Locations on time-varying networks, An algorithm finding p-medians of a graph, A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks, Solving the \(p\)-median problem on regular and lattice networks, Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions, A kernel search heuristic for a fair facility location problem, Continuous maximal covering location problems with interconnected facilities, The multi-period \(p\)-center problem with time-dependent travel times, Review of obnoxious facilities location problems, Simultaneous location-allocation of facilities and servers. a generalized heuristic, GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem, A voltage drop limited decentralized electric power distribution network, Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs, Robust design of service systems with immobile servers under demand uncertainty, Ordered \(p\)-median problems with neighbourhoods, Approximating the restricted 1-center in graphs, Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm, The balanced 2-median and 2-maxian problems on a tree, A model for locating preventive health care facilities, Clique-to-vertex monophonic distance in graphs, Siting of HIV/AIDS diagnostic equipment in South Africa: a case study in locational analysis, Minimizing the continuous diameter when augmenting a geometric tree with a shortcut, Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick, Unnamed Item, The complete vertex \(p\)-center problem, The capacitated facility location-allocation problem under uncertain environment, Fuzzy interdiction/fortification location problems on p-median systems, A minmax regret median problem on a tree under uncertain locations of the demand points, Affinity propagation: An exemplar‐based tool for clustering in psychological research, Ein Lagetheorem für einen Teilmedian eines k-Medians und damit eines von k optimalen Standorten einer diskreten räumlichen Verteilung mit Engpaßbereichen, Median problems on wheels and cactus graphs, On the computational complexity of centers locating in a graph, A bilevel mixed-integer program for critical infrastructure protection planning, Conditional facility location problems with continuous demand and a polygonal barrier, Lexicographicα-robustness: an application to the 1-median problem, Multiple criteria model for allocating new medical robotic devices to treatment centres, Ant colony optimization for finding medians of weighted graphs, Robust location problems with pos/neg weights on a tree, An exact solution approach for the interdiction median problem with fortification, Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives, Confined location of facilities on a graph, Condorcet winner configurations of linear networks, The multicriteria \(p\)-facility median location problem on networks, Design and operation for an electric taxi fleet, Designing a two-echelon distribution network under demand uncertainty, Minimax flow tree problems, The β-reliable minimax and maximin location problems on a network with probabilistic weights, Insertion heuristics for central cycle problems, Multiobjective Spatial Optimization: The Canadian Coast Guard, Public facility location using dispersion, population, and equity criteria, Optimal dwell point location of automated guided vehicles to minimize mean response time in a loop layout, Effectiveness-equity models for facility location problems on tree networks, Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem, Solving \(k\)-center problems involving sets based on optimization techniques, Absolute algebraic connectivity of trees, Mathematical Models and Search Algorithms for the Capacitated p-Center Problem, Least central subtrees, center, and centroid of a tree, Multi-echelon supply chain design considering unreliable facilities with facility hardening possibility, Big segment small segment global optimization algorithm on networks, On Haar's dual problem, The Maximum Coverage Location Problem, The \(p\)-facility ordered median problem on networks, The impact of the apex node on routing inside a pyramid structure, Unnamed Item, Localizacion sobre redes estocasticas con criterio minisum, Un algoritmo para determinar las medianas absolutas generales sobre una red tipo arbol, The Bounded Path Tree Problem, The Variance Location Problem on a Network with Continuously distributed demand, Distance measure and the \(p\)-median problem in rural areas, Optimizing location and size of rural schools in Chile, Polynomially bounded algorithms for locatingp-centers on a tree, Sequential location-allocation problems on chains and trees with probabilistic link demands, Minimean Location of Different Facilities on a Line Network, Unnamed Item
