On the Complexity of Some Common Geometric Location Problems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Allocation search methods for a generalized class of location-allocation problems
- Aggregation error for location models: Survey and analysis
- Solving probabilistic multi-facility Weber problem by vector quantization
- Location problems
- A heuristic for the p-center problem in graphs
- Geometric complexity of some location problems
- Geometric optimization and the polynomial hierarchy
- Geometric optimization and \(D^ P\)-completeness
- Polynomial algorithms for restricted Euclidean p-centre problems
- A study on two geometric location problems
- Improved complexity bounds for location problems on the real line
- Complexity of the repeaters allocating problem
- On the covering multiplicity of lattices
- Minimizing the sum of diameters efficiently
- The slab dividing approach to solve the Euclidean \(P\)-center problem
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance
- Hierarchically specified unit disk graphs
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- K-center and K-median problems in graded distances
- A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
- On the geometric behaviour of multidimensional location measures
- On the complexity of two circle connecting problems
- Complexity results for the \(p\)-median problem with mutual communication
- A theory for memory-based learning
- On the complexity of some basic problems in computational convexity. I. Containment problems
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
- 2-medians in trees with pos/neg weights
- The mixed center location problem
- Information-theoretic feature selection with discrete \(k\)-median clustering
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- A survey of healthcare facility location
- Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
- Research on gateway deployment of WMN based on maximum coupling subgraph and PSO algorithm
- The connected disk covering problem
- k-balanced center location problem: a new multi-objective facility location problem
- Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network
- Graph summarization with quality guarantees
- Near-linear time approximation schemes for geometric maximum coverage
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- A note on computing the center of uncertain data on the real line
- A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation.
- Hard cases of the multifacility location problem
- Complexity of the network median problem on planar grids
- General network design: a unified view of combined location and network design problems
- Quantifying spatial misallocation in centrally provided public goods
- Complexity of determining the most vital elements for the p-median and p-center location problems
- Solving a two-stage stochastic capacitated location-allocation problem with an improved PSO in emergency logistics
- Faster balanced clusterings in high dimension
- Planar multifacility location problems with tree structure and finite dominating sets
- The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
- Near-optimal large-scale k-medoids clustering
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
- An elliptical cover problem in drone delivery network design and its solution algorithms
- Facility reallocation on the line
- On the planar two-center problem and circular hulls
- On the computational complexities of various geography variants
- Online unit clustering and unit covering in higher dimensions
- Scaling and compressing melodies using geometric similarity measures
- Preclustering algorithms for imprecise points
- A two-level off-grid electric distribution problem on the continuous space
- Computing \(k\)-centers of uncertain points on a real line
- Biologically inspired parent selection in genetic algorithms
- A voltage drop limited decentralized electric power distribution network
- Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem
- Parameterized \(k\)-clustering: tractability island
- A new local search for continuous location problems
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- Fair redistricting is hard
- Deployment optimization of multi-hop wireless networks based on substitution graph
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
- On interval and circular-arc covering problems
- The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
- Multi-facility green Weber problem
- Competitive location in cognitive radio networks
- The searching over separators strategy to solve some NP-hard problems in subexponential time
- Minimal link visibility paths inside a simple polygon
- A heuristic algorithm for minimax sensor location in the plane
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems
- Fuzzy facility location-allocation problem under the Hurwicz criterion
- Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design
- The planar hub location problem: a probabilistic clustering approach
- A simple linear algorithm for computing rectilinear 3-centers
- A linear time algorithm for approximate 2-means clustering
- The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
- On the complexity of some geometric problems in unbounded dimension
- Topological stability of kinetic \(k\)-centers
- The two-center problem of uncertain points on a real line
- The \(p\)-center problem under locational uncertainty of demand points
- The coverage problem by aligned disks
- Parallel collision detection between moving robots for practical motion planning
- Speeding up dynamic programming in the line-constrained \(k\)-median
- Computing the line-constrained k-center in the plane for small k
- On planar medianoid competitive location problems with Manhattan distance
- Generating good starting solutions for the \(p\)-median problem in the plane
- Bounded fan-out \(m\)-center problem
- Computing k centers over streaming data for small k
This page was built for publication: On the Complexity of Some Common Geometric Location Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3318110)
