Finite Dominating Sets for Network Location Problems
From MaRDI portal
Publication:3981511
DOI10.1287/opre.39.1.100zbMath0744.90049OpenAlexW2053104033MaRDI QIDQ3981511
No author found.
Publication date: 26 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.39.1.100
network locationfinite dominating setgeneralized \(p\)-centergeneralized \(p\)-mediangeneralized cent-diangeneralized obnoxious 1- center
Related Items
A note on the subtree ordered median problem in networks based on nestedness property, Multiple sink location problem in path networks with a combinational objective, A framework for demand point and solution space aggregation analysis for location models, The collection depots location problem on networks, Unreliable point facility location problems on networks, Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs, Double bound method for solving the \(p\)-center location problem, \((r|p)\)-centroid problems on networks with vertex and edge demand, Minmax regret location--allocation problem on a network under uncertainty, A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem, More on the unimodality of domination polynomial of a graph, Approximability results for the $p$-centdian and the converse centdian problems, An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network, Covering edges in networks, Unnamed Item, Sequential competitive location on networks, Fuzzy location problems on networks., A generalized model of equality measures in network location problems, A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances, J-means and I-means for minimum sum-of-squares clustering on networks, On the structure of the solution set for the single facility location problem with average distances, Multi-facility ordered median problems in directed networks, The generalized \(p\)-centdian on network, On the roots of domination polynomials, A fractional model for locating semi-desirable facilities on networks, The Domination Equivalence Classes of Paths, The conditional \(p\)-dispersion problem, Eternal and Secure Domination in Graphs, THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS, A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks, Aggregation error for location models: Survey and analysis, Near-Optimal Dominating Sets via Random Sampling, A note on the location of an obnoxious facility on a network, The \(p\)-facility ordered median problem on networks, Median Problems in Networks, Discrete Center Problems, The Location of Undesirable Facilities, Exploiting Structure: Location Problems on Trees and Treelike Graphs, Infrastructure development for conversion to environmentally friendly fuel, Algorithmic results for ordered median problems, On the exponential cardinality of FDS for the ordered \(p\)-median problem, Variable neighborhood search for minimum sum-of-squares clustering on networks
