Pages that link to "Item:Q3318110"

The following pages link to On the Complexity of Some Common Geometric Location Problems (Q3318110):

Displaying 50 items.

• Bounded fan-out \(m\)-center problem (Q287146) (← links)
• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
• Location equilibria for a continuous competitive facility location problem under delivered pricing (Q336785) (← links)
• When centers can fail: a close second opportunity (Q337641) (← links)
• A genetic algorithm for the uncapacitated single allocation planar hub location problem (Q337658) (← links)
• Heuristics for a continuous multi-facility location problem with demand regions (Q337660) (← links)
• New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
• A new heuristic for solving the \(p\)-median problem in the plane (Q339602) (← links)
• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
• Covering moving points with anchored disks (Q421753) (← links)
• Accelerating the convergence in the single-source and multi-source Weber problems (Q428088) (← links)
• The planar \(k\)-means problem is NP-hard (Q441888) (← links)
• On the complexity of the \((r|p)\)-centroid problem in the plane (Q456933) (← links)
• One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
• New local searches for solving the multi-source Weber problem (Q512988) (← links)
• Computing the center of uncertain points on tree networks (Q527423) (← links)
• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
• An agent-based framework for modeling and solving location problems (Q610998) (← links)
• Covering points by disjoint boxes with outliers (Q617548) (← links)
• Prepositioning supplies in preparation for disasters (Q621705) (← links)
• A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
• Solving a continuous local access network design problem with a stabilized central column generation approach (Q635164) (← links)
• Dynamic and static algorithms for optimal placement of resources in a tree (Q671529) (← links)
• A faster algorithm for the two-center decision problem (Q685492) (← links)
• Boolean autoencoders and hypercube clustering complexity (Q690669) (← links)
• Local search algorithms for the red-blue median problem (Q692631) (← links)
• On the asymptotics of trimmed best \(k\)-nets (Q700155) (← links)
• A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand (Q709182) (← links)
• Speeding up dynamic programming in the line-constrained \(k\)-median (Q726094) (← links)
• The big cube small cube solution method for multidimensional facility location problems (Q733529) (← links)
• A continuous analysis framework for the solution of location-allocation problems with dense demand (Q733530) (← links)
• A simple heuristic for the p-centre problem (Q761233) (← links)
• A continuous location-allocation problem with zone-dependent fixed cost (Q816411) (← links)
• Demand point aggregation for planar covering location models (Q816417) (← links)
• A randomized algorithm for online unit clustering (Q839627) (← links)
• Stop location design in public transportation networks: covering and accessibility objectives (Q845574) (← links)
• The directional \(p\)-median problem: definition, complexity, and algorithms (Q864030) (← links)
• Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
• Recovery guarantees for exemplar-based clustering (Q897656) (← links)
• An improved data stream algorithm for clustering (Q904105) (← links)
• An optimal approximation algorithm for the rectilinear m-center problem (Q911284) (← links)
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
• The multi-facility location-allocation problem with polyhedral barriers (Q960384) (← links)
• A generalized Weiszfeld method for the multi-facility location problem (Q974995) (← links)
• Allocation search methods for a generalized class of location-allocation problems (Q1011223) (← links)
• Aggregation error for location models: Survey and analysis (Q1026594) (← links)
• Solving probabilistic multi-facility Weber problem by vector quantization (Q1027991) (← links)
• Location problems (Q1062596) (← links)
• A heuristic for the p-center problem in graphs (Q1098862) (← links)
• Geometric optimization and the polynomial hierarchy (Q1102110) (← links)