On the Complexity of Some Common Geometric Location Problems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Topological stability of kinetic \(k\)-centers
- A new local search for continuous location problems
- scientific article; zbMATH DE number 4102781 (Why is no real title available?)
- The \(p\)-center problem under locational uncertainty of demand points
- scientific article; zbMATH DE number 3965441 (Why is no real title available?)
- Complexity and approximability of certain bicriteria location problems
- Minimizing the size of the uncertainty regions for centers of moving entities
- The board packing problem
- Computing the center of uncertain points on tree networks
- The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
- A heuristic for the p-center problem in graphs
- The coverage problem by aligned disks
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- A survey of healthcare facility location
- Computing the rectilinear center of uncertain points in the plane
- Almost optimal solutions to k-clustering problems
- Prepositioning supplies in preparation for disasters
- The Mixed Center Location Problem
- Clustering under perturbation stability in near-linear time
- Quantifying spatial misallocation in centrally provided public goods
- Complexity results for the \(p\)-median problem with mutual communication
- Hierarchically specified unit disk graphs
- Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\)
- A novel method for vertex clustering in dynamic networks
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems
- Computing \(k\)-centers of uncertain points on a real line
- Location equilibria for a continuous competitive facility location problem under delivered pricing
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- Heuristics for a continuous multi-facility location problem with demand regions
- New heuristic algorithms for solving the planar p-median problem
- Fair redistricting is hard
- A simple linear algorithm for computing rectilinear 3-centers
- A note on computing the center of uncertain data on the real line
- Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm
- Linear Time Approximation Schemes for Geometric Maximum Coverage
- scientific article; zbMATH DE number 7650083 (Why is no real title available?)
- Fast heuristics for large scale covering-location problems
- Deployment optimization of multi-hop wireless networks based on substitution graph
- New local searches for solving the multi-source Weber problem
- An O(n n)-time algorithm for the k-center problem in trees
- Optimal placement of electric vehicle slow-charging stations: a continuous facility location problem under uncertainty
- Ant colony optimization for finding medians of weighted graphs
- An adaptive perturbation-based heuristic: an application to the continuous p-centre problem
- Near-optimal large-scale k-medoids clustering
- Local search algorithms for the red-blue median problem
- Aggregation error for location models: Survey and analysis
- Solving a continuous local access network design problem with a stabilized central column generation approach
- Hybrid k-clustering: blending k-median and k-center
- Demand point aggregation for planar covering location models
- Complexity of the repeaters allocating problem
- Stop location design in public transportation networks: covering and accessibility objectives
- Planar multifacility location problems with tree structure and finite dominating sets
- Technical Note—On the Complexity of Some Classes of Location Problems
- On the covering multiplicity of lattices
- A theory for memory-based learning
- On the complexity of two circle connecting problems
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
- Biologically inspired parent selection in genetic algorithms
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
- A continuous analysis framework for the solution of location-allocation problems with dense demand
- The discrete and mixed minimax 2-center problem
- Improved complexity bounds for location problems on the real line
- scientific article; zbMATH DE number 7622570 (Why is no real title available?)
- On planar medianoid competitive location problems with Manhattan distance
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- On the computational complexities of various geography variants
- Clustering with few disks to minimize the sum of radii
- Minimizing the sum of diameters efficiently
- The two-center problem of uncertain points on a real line
- One-dimensional \(k\)-center on uncertain data
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
- The searching over separators strategy to solve some NP-hard problems in subexponential time
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
- Computing data distribution from query selectivities
- Stabbing Convex Polygons with a Segment or a Polygon
- Using injection points in reformulation local search for solving continuous location problems
- An optimal and practical algorithm for the planar 2-center problem
- The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
- A voltage drop limited decentralized electric power distribution network
- A study on two geometric location problems
- Computing k centers over streaming data for small k
- A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification
- Improved starting solutions for the planar p-median problem
- An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
- On interval and circular-arc covering problems
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance
- A trajectory based heuristic for the planar \(p\)-median problem
- An elliptical cover problem in drone delivery network design and its solution algorithms
- Fuzzy facility location-allocation problem under the Hurwicz criterion
- Clustering with internal connectedness
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- Research on gateway deployment of WMN based on maximum coupling subgraph and PSO algorithm
- The connected disk covering problem
- The directional \(p\)-median problem: definition, complexity, and algorithms
- Covering points by disjoint boxes with outliers
- Hybrid k-clustering: blending k-median and k-center
- scientific article; zbMATH DE number 4099005 (Why is no real title available?)
- On the planar two-center problem and circular hulls
- Solving probabilistic multi-facility Weber problem by vector quantization
- k-median: exact recovery in the extended stochastic ball model
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)
