Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
From MaRDI portal
Publication:5508091
Cited in
(only showing first 100 items - show all)- Solving \(k\)-center problems involving sets based on optimization techniques
- THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK
- The \(k\)-ball \(l\)-path branch weight centroid
- Classical and inverse median location problems under uncertain environment
- Mind the gap: edge facility location problems in theory and practice
- Optimal M/G/1 server location on a tree network with continuous link demands
- Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
- Branch‐and‐cut algorithms for the ‐arborescence star problem
- BEAMR: an exact and approximate model for the \(p\)-median problem
- Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
- Benders decomposition for network design covering problems
- Location of service facilities for the elderly
- A fuzzy algorithm for continuous capacitated location allocation model with risk consideration
- A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems
- Optimizing location and size of rural schools in Chile
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- New genetic algorithms based approaches to continuous \(p\)-median problem
- Efficient parallel algorithms for r-dominating set and p-center problems on trees
- Generalized center problems with outliers
- Discrete facility location in machine learning
- A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm
- Algorithms for the m-center problems: A survey
- Heuristics for the fixed cost median problem
- A dynamic logistics coordination model for evacuation and support in disaster response activities
- Facility location models for distribution system design
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- Heuristic concentration and tabu search: A head to head comparison
- Distributed algorithm for finding a core of a tree network
- On statistical bounds of heuristic solutions to location problems
- Affinity propagation: An exemplar‐based tool for clustering in psychological research
- The balanced 2-median and 2-maxian problems on a tree
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- A neural model for the \(p\)-median problem
- Approximability results for the $p$-centdian and the converse centdian problems
- Optimizing the location of a production firm
- A continuous location-allocation problem with zone-dependent fixed cost
- An optimal method for solving the (generalized) multi-Weber problem
- A Benders decomposition based framework for solving cable trench problems
- The Weber obnoxious facility location model: a big arc small arc approach
- A gamma heuristic for the \(p\)-median problem
- An efficient tabu search procedure for the \(p\)-median problem
- Multiple criteria model for allocating new medical robotic devices to treatment centres
- Integer programming formulations of discrete hub location problems
- Effects of multipurpose shopping trips on retail store location in a duopoly
- Strategic ambulance location for heterogeneous regions
- A new heuristic for solving the \(p\)-median problem in the plane
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
- Trimmed best \(k\)-nets: A robustified version of an \(L_{\infty}\)-based clustering method
- Heuristic concentration: Two stage solution construction
- The capacitated facility location-allocation problem under uncertain environment
- Application of facility location modeling constructs to vendor selection problems
- Small Space Stream Summary for Matroid Center
- On locating new facilities in a competitive environment
- A warehouse location-allocation bilevel problem that considers inventory policies
- Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
- A decomposition approach for facility location and relocation problem with uncertain number of future facilities
- Closest assignment constraints in discrete location 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
- On the lexicographic minimax approach to location problems
- Uncertain models for single facility location problems on networks
- New approaches to the robust 1-center location problems on tree networks
- The multi-facility location-allocation problem with polyhedral barriers
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- The heuristic concentration-integer and its application to a class of location problems
- Solving the \(p\)-median problem on regular and lattice networks
- Clean water network design for refugee camps
- A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff
- Sequential location-allocation problems on chains and trees with probabilistic link demands
- Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty
- A network location-allocation model trading off flow capturing and \(p\)- median objectives
- Approximability results for the converse connected \(p\)-centre problem
- Exploiting Structure: Location Problems on Trees and Treelike Graphs
- 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
- On solving large instances of the capacitated facility location problem
- Forecast horizons and dynamic facility location planning
- The stochastic p-hub center problem with service-level constraints
- Exact solution approaches for the discrete α‐neighbor p‐center problem
- The gravity multiple server location problem
- Equity models in planar location
- Affinity propagation and uncapacitated facility location problems
- A variable neighborhood search for the median location problem with interconnected facilities
- Un nuevo resultado sobre la complejidad del problema delP-centro
- A quotient space formulation for generative statistical analysis of graphical data
- Planning sustainable community health schemes in rural areas of developing countries
- Comparative error bound theory for three location models: continuous demand versus discrete demand
- A two‐tier urban delivery network with robot‐based deliveries
- The exam location problem: mathematical formulations and variants
- Confidence in heuristic solutions?
- A heuristic for the p-center problem in graphs
- Mixed planar/network facility location problems
- The gravity \(p\)-median model
- Location and reorganization problems: the Calabrian health care system case
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- The support unit location problem to road traffic surveys with multi-stages
- Precedence-constrained arborescences
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
- Network distance characteristics that affect computational effort in \(p\)-median location problems
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
This page was built for publication: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5508091)