Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
From MaRDI portal
Publication:5508091
DOI10.1287/opre.13.3.462zbMath0135.20501OpenAlexW2127859636MaRDI QIDQ5508091
Publication date: 1965
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.13.3.462
Related Items
A bi-objective approach to discrete cost-bottleneck location problems, Equity measurement in facility location analysis: A review and framework, Application of facility location modeling constructs to vendor selection problems, On statistical bounds of heuristic solutions to location problems, The stochastic \(p\)-hub center problem with service-level constraints, The \(p\)-arborescence star problem: formulations and exact solution approaches, Optimal M/G/1 server location on a tree network with continuous link demands, Flow intercepting facility location: Problems, models and heuristics, Mixed planar/network facility location problems, Stop location design in public transportation networks: covering and accessibility objectives, A heuristic for the p-center problem in graphs, Location and reorganization problems: the Calabrian health care system case, Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem, Optimal shift partitioning of pharmacies, Heuristics for a continuous multi-facility location problem with demand regions, The Weber obnoxious facility location model: a big arc small arc approach, A Benders decomposition based framework for solving cable trench problems, A new heuristic for solving the \(p\)-median problem in the plane, On solving large instances of the capacitated facility location problem, A dynamic logistics coordination model for evacuation and support in disaster response activities, The gravity \(p\)-median model, Equity models in planar location, Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm, Facility location on a tree with maximum distance constraints, Trimmed best \(k\)-nets: A robustified version of an \(L_{\infty}\)-based clustering method, The \(k\)-ball \(l\)-path branch weight centroid, The gravity multiple server location problem, Planning a capacitated road network with flexible travel times: a genetic algorithm, Bee colony optimization for the \(p\)-center problem, A decomposition approach for facility location and relocation problem with uncertain number of future facilities, Closest assignment constraints in discrete location problems, Algorithms for the m-center problems: A survey, Uncertain models for single facility location problems on networks, A method for solving to optimality uncapacitated location problems, Comparative error bound theory for three location models: continuous demand versus discrete demand, Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm, Benders decomposition for very large scale partial set covering and maximal covering location problems, On locating new facilities in a competitive environment, Locational analysis, Marginal analysis for the fuzzy \(p\)-median problem, Locating optimal timetables and vehicle schedules in a transit line, Data aggregation for \(p\)-median problems, Benders decomposition for the uncapacitated multiple allocation hub location problem, Threshold robustness in discrete facility location problems: a bi-objective approach, Classical and inverse median location problems under uncertain environment, 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, A fuzzy algorithm for continuous capacitated location allocation model with risk consideration, Effects of multipurpose shopping trips on retail store location in a duopoly, Planning sustainable community health schemes in rural areas of developing countries, An optimal method for solving the (generalized) multi-Weber problem, Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane, Strategic ambulance location for heterogeneous regions, Risk management in uncapacitated facility location models with random demands, 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, Lagrangean relaxation heuristics for the \(p\)-cable-trench problem, An aggregation heuristic for large scale p-median problem, New genetic algorithms based approaches to continuous \(p\)-median problem, Multi-facility ordered median problems in directed networks, Facility location models for distribution system design, Location analysis: a synthesis and survey, The minisum location problem on an undirected network with continuous link demands, Optimizing the location of a production firm, Clean water network design for refugee camps, A quotient space formulation for generative statistical analysis of graphical data, Efficient algorithms for two generalized 2-median problems and the group median problem on trees, A gamma heuristic for the \(p\)-median problem, Confidence in heuristic solutions?, Efficient parallel algorithms for r-dominating set and p-center problems on trees, On the lexicographic minimax approach to location problems, 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, A dynamic programming heuristic for the \(P\)-median problem, A note on balance vertices in trees, 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, Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach, Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs, Minimizing the sum of the \(k\) largest functions in linear time., A comparison of two dual-based procedures for solving the p-median problem, Solving large single allocation \(p\)-hub problems with two or three hubs, Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty, 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, Implementing Larson and Sadiq's location model in a geographic information system, 'Multidimensional' extensions and a nested dual approach for the m-median problem, Enhancements to two exact algorithms for solving the vertex \(P\)-center problem, A simulated annealing methodology to distribution network design and management, An exact algorithm for the fuzzy p-median problem, A continuous location-allocation problem with zone-dependent fixed cost, Demand point aggregation for planar covering location models, Location of service facilities for the elderly, Worst-case incremental analysis for a class ofp-facility location problems, A capacitated hub location problem in freight logistics multimodal networks, Ordered median problem with demand distribution weights, A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm, The network \(p\)-median problem with discrete probabilistic demand weights, An efficient algorithm for solving the median problem on real road networks, Fuzzy facility location-allocation problem under the Hurwicz criterion, A bibliography for some fundamental problem categories in discrete location science, A neural model for the \(p\)-median problem, BEAMR: an exact and approximate model for the \(p\)-median problem, The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity, THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK, Multi-criteria decision analysis for efficient location-allocation problem combining DEA and goal programming, Solving the \(p\)-median problem on regular and lattice networks, Benders decomposition for network design covering problems, A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem, Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs, Discrete facility location in machine learning, Approximability results for the $p$-centdian and the converse centdian problems, Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem, Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights, The exam location problem: mathematical formulations and variants, A two‐tier urban delivery network with robot‐based deliveries, Identifying trade‐offs in equity and efficiency for simultaneously optimizing location and multipriority dispatch of ambulances, Branch‐and‐cut algorithms for the ‐arborescence star problem, New approaches to the robust 1-center location problems on tree networks, Automatic generation of dominance breaking nogoods for a class of constraint optimization problems, Efficient algorithms for finding <scp>2‐medians</scp> of a tree, Covering edges in networks, Configuration‐based approach for topological problems in the design of wireless sensor networks, Constant work-space algorithms for facility location problems, Precedence-constrained arborescences, Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities, Approximability results for the converse connectedp-centre problem†, Mind the gap: edge facility location problems in theory and practice, Cellular automata rules solving the wireless sensor network coverage problem, Unnamed Item, Multi-type maximal covering location problems: hybridizing discrete and continuous problems, The balanced 2-median and 2-maxian problems on a tree, Exact solution approaches for the discrete α‐neighbor p‐center problem, Siting of HIV/AIDS diagnostic equipment in South Africa: a case study in locational analysis, A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM, Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick, The capacitated facility location-allocation problem under uncertain environment, Affinity propagation: An exemplar‐based tool for clustering in psychological research, Ambulance Emergency Response Optimization in Developing Countries, Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods, Small Space Stream Summary for Matroid Center, On the computational complexity of centers locating in a graph, Unnamed Item, Unnamed Item, Multiple criteria model for allocating new medical robotic devices to treatment centres, Ant colony optimization for finding medians of weighted graphs, An exact solution approach for the interdiction median problem with fortification, The multicriteria \(p\)-facility median location problem on networks, Un nuevo resultado sobre la complejidad del problema delP-centro, The β-reliable minimax and maximin location problems on a network with probabilistic weights, A fractional model for locating semi-desirable facilities on networks, Affinity propagation and uncapacitated facility location problems, A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff, Solving \(k\)-center problems involving sets based on optimization techniques, Generalized Center Problems with Outliers, 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, Big segment small segment global optimization algorithm on networks, The support unit location problem to road traffic surveys with multi-stages, Heuristics for the fixed cost median problem, Median Problems in Networks, Discrete Center Problems, Covering Problems, Stochastic Analysis in Location Research, Exploiting Structure: Location Problems on Trees and Treelike Graphs, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems, An approximation algorithm for the facility location problem with lexicographic minimax objective, Unnamed Item, The Variance Location Problem on a Network with Continuously distributed demand, Optimizing location and size of rural schools in Chile, Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants, Sequential location-allocation problems on chains and trees with probabilistic link demands, Probability chains: a general linearization technique for modeling reliability in facility location and related problems, Variable neighborhood search for minimum sum-of-squares clustering on networks
