Repulsion-based p-dispersion with distance constraints in non-convex polygons
From MaRDI portal
Publication:2070713
DOI10.1007/s10479-021-04281-zzbMath1478.90105OpenAlexW3204795379MaRDI QIDQ2070713
Melkior Ornik, Kathleen Xu, Zhengguan Dai
Publication date: 24 January 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8739219
Continuous location (90B85) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- Unnamed Item
- A literature review on circle and sphere packing problems: models and methodologies
- A heuristic for the circle packing problem with a variety of containers
- Exact algorithms for the max-min dispersion problem
- Approximate solutions of continuous dispersion problems
- The discrete p-dispersion problem
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Analytical models for locating undesirable facilities
- A comparison of \(p\)-dispersion heuristics
- Dense packings of congruent circles in a circle
- Strategic facility location: A review
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- Dense packing of congruent circles in free-form non-convex containers
- An Analysis of Network Location Problems with Distance Constraints
- OPTIMAL FACILITY LOCATION UNDER RANDOM DEMAND WITH GENERAL COST STRUCTURE
- Optimal Facility Location with Concave Costs
- Solving the Continuous p-Dispersion Problem Using Non-linear Programming
- Packing circles within ellipses
- Planning Algorithms
- Approximation of geometric dispersion problems
This page was built for publication: Repulsion-based p-dispersion with distance constraints in non-convex polygons
