The disruptive anti-covering location problem

DOI10.1016/J.EJOR.2015.06.054zbMATH Open1346.90512OpenAlexW1156678223MaRDI QIDQ320083FDOQ320083

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

Recommendations

• scientific article; zbMATH DE number 5990408
• 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

zbMATH Keywords

disruptionpackinglocation modelinganti-coverR-separation

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• An improved typology of cutting and packing problems
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Heuristic algorithms for the three-dimensional bin packing problem
• The minimum weighted covering location problem with distance constraints
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• Heuristics for the container loading problem
• An improved algorithm for the packing of unequal circles within a larger containing circle
• 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
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• 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
• 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 Analysis of Network Location Problems with Distance Constraints
• Title not available (Why is that?)
• A Multiobjective Approach to Design Franchise Outlet Networks
• Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
• The discrete p-dispersion problem
• Solving circle packing problems by global optimization: numerical results and industrial applications

Cited In (3)

• The complete vertex \(p\)-center problem
• Review of obnoxious facilities location problems
• Title not available (Why is that?)

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)