The disruptive anti-covering location problem
From MaRDI portal
Publication:320083
DOI10.1016/j.ejor.2015.06.054zbMath1346.90512OpenAlexW1156678223MaRDI QIDQ320083
Richard L. Church, Matthew R. Niblett
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.054
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The discrete p-dispersion problem
- Solving circle packing problems by global optimization: numerical results and industrial applications
- The equitable dispersion problem
- Integer-friendly formulations for the \(r\)-separation problem
- Facets for node packing
- Solving the anti-covering location problem using Lagrangian relaxation
- Heuristics for the container loading problem
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Heuristic algorithms for the three-dimensional bin packing problem
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- The minimum weighted covering location problem with distance constraints
- Optimal reserve site selection with distance requirements
- Column generation approach for the point-feature cartographic label placement problem
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- Public facility location using dispersion, population, and equity criteria
- Three-dimensional packing of items with limited load bearing strength
- On the unified dispersion problem: efficient formulations and exact algorithms
- An improved typology of cutting and packing problems
- An Analysis of Network Location Problems with Distance Constraints
- A Multiobjective Approach to Design Franchise Outlet Networks
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
This page was built for publication: The disruptive anti-covering location problem
