Pages that link to "Item:Q761233"

The following pages link to A simple heuristic for the p-centre problem (Q761233):

Displaying 41 items.

• A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
• The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
• On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
• The fault-tolerant capacitated \(K\)-center problem (Q484314) (← links)
• Grouping objects in multi-band images using an improved eigenvector-based algorithm (Q604192) (← links)
• An approximation algorithm for the edge-dilation \(k\)-center problem. (Q703267) (← links)
• Demand point aggregation for planar covering location models (Q816417) (← links)
• The stochastic \(p\)-hub center problem with service-level constraints (Q833535) (← links)
• Location problems (Q1062596) (← links)
• A heuristic for the p-center problem in graphs (Q1098862) (← links)
• On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems (Q1196217) (← links)
• A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem (Q1291662) (← links)
• An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms (Q1367876) (← links)
• Compact location problems (Q1391322) (← links)
• Lexicographic local search and the \(p\)-center problem. (Q1410610) (← links)
• Fault tolerant \(K\)-center problems (Q1575549) (← links)
• A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
• \(k\)-center problems with minimum coverage (Q1770377) (← links)
• Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs (Q1799228) (← links)
• A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
• Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
• A framework for demand point and solution space aggregation analysis for location models (Q1887955) (← links)
• Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
• Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints (Q2072077) (← 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)
• The 1-center problem in the plane with independent random weights (Q2456633) (← links)
• The maximal dispersion problem and the ``first point outside the neighbourhood'' heuristic (Q2638928) (← links)
• On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
• Insertion heuristics for central cycle problems (Q3057168) (← links)
• Heuristic methods for the<i>p</i>-center problem (Q3359995) (← links)
• A Best Possible Heuristic for the <i>k</i>-Center Problem (Q3680584) (← links)
• (Q3783313) (← links)
• (Q3800086) (← links)
• The p-center problem in \(R^ n\) with weighted Tchebycheff norms (Q3989472) (← links)
• Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624) (← links)
• Facility location with dynamic distance functions (Q5054838) (← links)
• On cost-aware biased respondent group selection for minority opinion survey (Q5298345) (← links)
• Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)
• Compact location problems with budget and communication constraints (Q6064048) (← links)
• A constructive heuristic for the uniform capacitated vertex \(k\)-center problem (Q6579775) (← links)