Pages that link to "Item:Q1098862"

The following pages link to A heuristic for the p-center problem in graphs (Q1098862):

Displaying 43 items.

• The \(p\)-neighbor \(k\)-center problem (Q293209) (← links)
• On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
• Graph clustering (Q458448) (← links)
• The fault-tolerant capacitated \(K\)-center problem (Q484314) (← links)
• An optimal algorithm for the weighted backup 2-center problem on a tree (Q513273) (← links)
• The minimum weight \(t\)-composition of an integer (Q690540) (← links)
• An approximation algorithm for the edge-dilation \(k\)-center problem. (Q703267) (← links)
• A simple heuristic for the p-centre problem (Q761233) (← links)
• An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984) (← links)
• Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
• A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem (Q1291662) (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
• Lexicographic local search and the \(p\)-center problem. (Q1410610) (← links)
• Fault tolerant \(K\)-center problems (Q1575549) (← links)
• The multi-service center problem (Q1680546) (← links)
• \(k\)-center problems with minimum coverage (Q1770377) (← links)
• Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
• The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
• Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs (Q2185812) (← links)
• A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem (Q2201993) (← links)
• On interval and circular-arc covering problems (Q2327673) (← links)
• Asymmetric \(k\)-center with minimum coverage (Q2380063) (← links)
• Asymmetry in \(k\)-center variants (Q2503348) (← links)
• One-way and round-trip center location problems (Q2568335) (← links)
• On some variants of Euclidean \(k\)-supplier (Q2670484) (← links)
• Approximability results for the converse connected<i>p</i>-centre problem^† (Q2958261) (← links)
• Insertion heuristics for central cycle problems (Q3057168) (← links)
• Heuristic methods for the<i>p</i>-center problem (Q3359995) (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• A vertex-closing approach to the p-center problem (Q3474476) (← links)
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION (Q3526982) (← links)
• A Best Possible Heuristic for the <i>k</i>-Center Problem (Q3680584) (← links)
• Algorithms for finding P-centers on a weighted tree (for relatively small P) (Q3703611) (← links)
• On the Solution Value of the Continuous <i>p</i>-Center Location Problem on a Graph (Q3758534) (← links)
• (Q3763866) (← links)
• (Q3800086) (← links)
• Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624) (← links)
• Generalized eccentricity, radius, and diameter in graphs (Q4934876) (← links)
• Facility location with dynamic distance functions (Q5054838) (← links)
• Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)
• Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)
• A constructive heuristic for the uniform capacitated vertex \(k\)-center problem (Q6579775) (← links)