Pages that link to "Item:Q4228753"

The following pages link to The p-center location problem in an area (Q4228753):

Displaying 33 items.

• A Voronoi-based heuristic algorithm for locating distribution centers in disasters (Q262891) (← links)
• Covering part of a planar network (Q291695) (← links)
• A multi-objective model for locating search and rescue boats (Q323331) (← links)
• Heuristics for a continuous multi-facility location problem with demand regions (Q337660) (← links)
• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
• Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
• Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
• Sequential location of two facilities: comparing random to optimal location of the first facility (Q512975) (← links)
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
• The variable radius covering problem (Q1027534) (← links)
• Cooperative cover of uniform demand (Q2005869) (← links)
• An approximation algorithm for \(k\)-center problem on a convex polygon (Q2015790) (← links)
• An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
• Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
• Wildfire burn scar encapsulation. Subsetting common spatial domains for post-wildfire debris flow predictions over the United States (Q2119735) (← links)
• The complete vertex \(p\)-center problem (Q2219518) (← links)
• Conditional facility location problems with continuous demand and a polygonal barrier (Q2239930) (← links)
• Optimal partitioning of an interval and applications to Sturm-Liouville eigenvalues (Q2293705) (← links)
• A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach (Q2318909) (← links)
• A heuristic algorithm for minimax sensor location in the plane (Q2370328) (← links)
• The equitable location problem on the plane (Q2371347) (← links)
• The minimum equitable radius location problem with continuous demand (Q2378371) (← links)
• Regional service coverage modeling (Q2384882) (← links)
• A directional approach to gradual cover (Q2421326) (← links)
• On one-dimensional continua uniformly approximating planar sets (Q2509085) (← links)
• A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff (Q2514827) (← links)
• Spectral partitions for Sturm–Liouville problems (Q3298571) (← links)
• On the horseshoe conjecture for maximal distance minimizers (Q4646820) (← links)
• Long-term planning<i>versus</i>short-term planning in the asymptotical location problem (Q5192123) (← links)
• The support unit location problem to road traffic surveys with multi-stages (Q5244290) (← 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)
• A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic (Q6070495) (← links)