The disruptive anti-covering location problem

DOI10.1016/J.EJOR.2015.06.054MaRDI QIDQ320083zbMATHOpenAlexFDO

Authors Matthew R. Niblett, Richard L. Church

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

zbMATH Keywords

disruptionpackinglocation modelinganti-coverR-separation

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Publication:3105843
• Comparison Of Four Models For dispersing Facilities
• Location covering models. History, applications and advancements
• Facility dispersion problems under capacity and cost constraints
• The discrete p-dispersion problem

Cites work

• scientific article; zbMATH DE number 2182144 (Why is no real title available?)
• scientific article; zbMATH DE number 1340526 (Why is no real title available?)
• A Multiobjective Approach to Design Franchise Outlet Networks
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• An Analysis of Network Location Problems with Distance Constraints
• An improved algorithm for the packing of unequal circles within a larger containing circle
• An improved typology of cutting and packing problems
• Column generation approach for the point-feature cartographic label placement problem
• Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
• Facets for node packing
• Heuristic algorithms for the three-dimensional bin packing problem
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Heuristics for the container loading problem
• Integer-friendly formulations for the \(r\)-separation problem
• Lagrangean relaxation with clusters for point-feature cartographic label placement problems
• On the unified dispersion problem: efficient formulations and exact algorithms
• Optimal reserve site selection with distance requirements
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• Public facility location using dispersion, population, and equity criteria
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Solving the anti-covering location problem using Lagrangian relaxation
• The discrete p-dispersion problem
• The equitable dispersion problem
• The minimum weighted covering location problem with distance constraints
• Three-dimensional packing of items with limited load bearing strength

Cited in

(3)

• scientific article; zbMATH DE number 5990408 (Why is no real title available?)
• The complete vertex \(p\)-center problem
• Review of obnoxious facilities location problems

Describes a project that uses

Uses Software

• CirclePack

This page was built for publication: The disruptive anti-covering location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320083)