Pages that link to "Item:Q3748028"

The following pages link to An Algorithm for the <i>p</i>-Center Problem in the Plane (Q3748028):

Displaying 37 items.

• Maximizing the minimum cover probability by emergency facilities (Q512997) (← links)
• On solving the planar \(k\)-centrum problem with Euclidean distances (Q613427) (← links)
• A simple heuristic for the p-centre problem (Q761233) (← links)
• The \(K\)-connection location problem in a plane (Q816418) (← links)
• A note on the m-center problem with rectilinear distances (Q913636) (← links)
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
• Layout of facilities with some fixed points (Q1086124) (← links)
• Polynomial algorithms for restricted Euclidean p-centre problems (Q1116694) (← links)
• Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
• A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem (Q1291662) (← links)
• A \(p\)-center grid-positioning aggregation procedure (Q1304506) (← links)
• An algorithm for finding the Chebyshev center of a convex polyhedron (Q1317311) (← links)
• A near-linear algorithm for the planar 2-center problem (Q1364134) (← links)
• An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions (Q1694399) (← links)
• Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane (Q1752856) (← links)
• Dominant, an algorithm for the \(p\)-center problem. (Q1811146) (← links)
• More planar two-center algorithms (Q1961384) (← links)
• An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
• Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem (Q2253481) (← links)
• The minimum equitable radius location problem with continuous demand (Q2378371) (← links)
• Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem (Q2412430) (← links)
• The 1-center problem in the plane with independent random weights (Q2456633) (← links)
• Locating a central hunter on the plane (Q2481118) (← links)
• An efficient algorithm for the Euclidean \(r\)-centrum location problem (Q2570749) (← links)
• (Q2728891) (← links)
• Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs (Q2944488) (← links)
• THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
• (Q3404171) (← links)
• The <i>P</i>-Centroid Problem on an Inclined Plane (Q3775297) (← links)
• Relaxation method for the solution of the minimax location-allocation problem in Euclidean space (Q3793913) (← links)
• The p-center location problem in an area (Q4228753) (← links)
• Polynomial algorithms for center location on spheres (Q4367291) (← links)
• The conditional \(p\)-center problem in the plane (Q4695785) (← links)
• On the rectangularp-center problem (Q4723543) (← links)
• Algorithms for center and Tverberg points (Q5361655) (← links)
• Continuous Center Problems (Q5506719) (← links)
• A faster algorithm for the constrained minimum covering circle problem to expedite solving <i>p</i>‐center problems in an irregularly shaped area with holes (Q6053130) (← links)