Pages that link to "Item:Q3981511"

The following pages link to Finite Dominating Sets for Network Location Problems (Q3981511):

Displaying 45 items.

• Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
• \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
• Sequential competitive location on networks (Q439407) (← links)
• J-means and I-means for minimum sum-of-squares clustering on networks (Q526420) (← links)
• On the structure of the solution set for the single facility location problem with average distances (Q543416) (← links)
• Multi-facility ordered median problems in directed networks (Q545449) (← links)
• On the exponential cardinality of FDS for the ordered \(p\)-median problem (Q813976) (← links)
• Multiple sink location problem in path networks with a combinational objective (Q828700) (← links)
• Minmax regret location--allocation problem on a network under uncertainty (Q864020) (← links)
• Aggregation error for location models: Survey and analysis (Q1026594) (← links)
• Fuzzy location problems on networks. (Q1426741) (← links)
• A note on the location of an obnoxious facility on a network (Q1579481) (← links)
• A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances (Q1753405) (← links)
• Infrastructure development for conversion to environmentally friendly fuel (Q1847257) (← links)
• Algorithmic results for ordered median problems (Q1866979) (← links)
• A framework for demand point and solution space aggregation analysis for location models (Q1887955) (← links)
• Planar multifacility location problems with tree structure and finite dominating sets (Q2010913) (← links)
• On the roots of domination polynomials (Q2014706) (← links)
• The conditional \(p\)-dispersion problem (Q2046325) (← links)
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
• Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
• A note on the subtree ordered median problem in networks based on nestedness property (Q2358843) (← links)
• A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem (Q2400004) (← links)
• An optimal locating-dominating set in the infinite triangular grid (Q2433724) (← links)
• A generalized model of equality measures in network location problems (Q2456627) (← links)
• The \(p\)-facility ordered median problem on networks (Q2568602) (← links)
• Unreliable point facility location problems on networks (Q2636810) (← links)
• Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs (Q2642504) (← links)
• Near-Optimal Dominating Sets via Random Sampling (Q2830067) (← links)
• Eternal and Secure Domination in Graphs (Q3384616) (← links)
• THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS (Q3632030) (← links)
• The collection depots location problem on networks (Q4539882) (← links)
• A unified approach to network location problems (Q4934873) (← links)
• Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median (Q5002699) (← links)
• More on the unimodality of domination polynomial of a graph (Q5083860) (← links)
• The Domination Equivalence Classes of Paths (Q5377030) (← links)
• Median Problems in Networks (Q5506718) (← links)
• Discrete Center Problems (Q5506720) (← links)
• The Location of Undesirable Facilities (Q5506725) (← links)
• Exploiting Structure: Location Problems on Trees and Treelike Graphs (Q5506729) (← links)
• The generalized \(p\)-centdian on network (Q5937142) (← links)
• A fractional model for locating semi-desirable facilities on networks (Q5955092) (← links)
• Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)
• An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network (Q6065885) (← links)
• Covering edges in networks (Q6087399) (← links)