Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

Cited In (only showing first 100 items - show all)

Benders decomposition for network design covering problems
BEAMR: an exact and approximate model for the \(p\)-median problem
Optimizing location and size of rural schools in Chile
New genetic algorithms based approaches to continuous \(p\)-median problem
Heuristics for the fixed cost median problem
Optimal algorithms for selective variants of the classical and inverse median location problems on trees
A dynamic logistics coordination model for evacuation and support in disaster response activities
Facility location models for distribution system design
On statistical bounds of heuristic solutions to location problems
A neural model for the \(p\)-median problem
Benders decomposition for the uncapacitated multiple allocation hub location problem
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
An efficient tabu search procedure for the \(p\)-median problem
Integer programming formulations of discrete hub location problems
Trimmed best \(k\)-nets: A robustified version of an \(L_{\infty}\)-based clustering method
A new heuristic for solving the \(p\)-median problem in the plane
On locating new facilities in a competitive environment
On the lexicographic minimax approach to location problems
A decomposition approach for facility location and relocation problem with uncertain number of future facilities
Closest assignment constraints in discrete location problems
The multi-facility location-allocation problem with polyhedral barriers
Uncertain models for single facility location problems on networks
The heuristic concentration-integer and its application to a class of location problems
Sequential location-allocation problems on chains and trees with probabilistic link demands
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
A network location-allocation model trading off flow capturing and \(p\)- median objectives
Forecast horizons and dynamic facility location planning
The stochastic \(p\)-hub center problem with service-level constraints
Equity models in planar location
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 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 network \(p\)-median problem with discrete probabilistic demand weights
A bibliography for some fundamental problem categories in discrete location science
Equity measurement in facility location analysis: A review and framework
Multi-facility ordered median problems in directed networks
The capacitated multiple allocation hub location problem: Formulations and algorithms
Solving large single allocation \(p\)-hub problems with two or three hubs
Optimal shift partitioning of pharmacies
Heuristics for a continuous multi-facility location problem with demand regions
Bee colony optimization for the \(p\)-center problem
Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
Ant colony optimization for finding medians of weighted graphs
Location analysis: a synthesis and survey
A simulated annealing methodology to distribution network design and management
On worst-case aggregation analysis for network location problems
Lagrangean relaxation-based techniques for solving facility location problems
Demand point aggregation for planar covering location models
Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
Stop location design in public transportation networks: covering and accessibility objectives
Locational analysis
The minisum location problem on an undirected network with continuous link demands
Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
Risk management in uncapacitated facility location models with random demands
Some new algorithms for location problems on networks
Locating optimal timetables and vehicle schedules in a transit line
A comparison of two dual-based procedures for solving the p-median problem
'Multidimensional' extensions and a nested dual approach for the m-median problem
Data aggregation for \(p\)-median problems
Configuration‐based approach for topological problems in the design of wireless sensor networks
Efficient algorithms for two generalized 2-median problems and the group median problem on trees
Multi-type maximal covering location problems: hybridizing discrete and continuous problems
Threshold robustness in discrete facility location problems: a bi-objective approach
Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
An aggregation heuristic for large scale p-median problem
A method for solving to optimality uncapacitated location problems
Title not available (Why is that?)
Fuzzy facility location-allocation problem under the Hurwicz criterion
A bi-objective approach to discrete cost-bottleneck location problems
Minimizing the sum of the \(k\) largest functions in linear time.
Probability chains: a general linearization technique for modeling reliability in facility location and related problems
Discrete center problems
A capacitated hub location problem in freight logistics multimodal networks
Facility location on a tree with maximum distance constraints
Big segment small segment global optimization algorithm on networks
An exact solution approach for the interdiction median problem with fortification
The multicriteria \(p\)-facility median location problem on networks
Covering edges in networks
A dynamic programming heuristic for the \(P\)-median problem
Variable neighborhood search for minimum sum-of-squares clustering on networks
Solving \(k\)-center problems involving sets based on optimization techniques
Benders decomposition for very large scale partial set covering and maximal covering location problems
Mind the gap: edge facility location problems in theory and practice
The \(k\)-ball \(l\)-path branch weight centroid
Classical and inverse median location problems under uncertain environment
Branch‐and‐cut algorithms for the ‐arborescence star problem
Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
Optimal M/G/1 server location on a tree network with continuous link demands
Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
Location of service facilities for the elderly
A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems
A fuzzy algorithm for continuous capacitated location allocation model with risk consideration

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)