Locating two obnoxious facilities using the weighted maximin criterion
From MaRDI portal
Publication:2583716
Recommendations
Cites work
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- An efficient parallel algorithm for the row minima of a totally monotone matrix
- An O\((n \log{}n)\) algorithm for a maxmin location problem
- Analytical models for locating undesirable facilities
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Computing largest empty circles with location constraints
- Fast randomized parallel methods for planar convex hull construction
- Finding kth paths and p-centers by generating and searching good data structures
- scientific article; zbMATH DE number 1629820 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 1253055 (Why is no real title available?)
- Improved algorithms for placing undesirable facilities
- New Results on the Complexity of p-Centre Problems
- Obnoxious Facility Location on Graphs
- Obnoxious facility location: complete service with minimal harm
- On search over rationals
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
- Optimal packing and covering in the plane are NP-complete
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Packing two disks in a polygon
- Packing two disks into a polygonal environment.
- Parallelism in Comparison Problems
- Slowing down sorting networks to obtain faster sorting algorithms
- Sweep methods for parallel computational geometry
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- The discrete p-dispersion problem
- The generalized diameter of a graph
- The single facility location problem with minimum distance constraints
- Visibility and intersection problems in plane geometry
Cited in
(17)- Efficiency for continuous facility location problems with attraction and repulsion
- Optimal placement of rectangles on a plane with fixed objects
- Computing median and antimedian sets in median graphs
- Review of obnoxious facilities location problems
- scientific article; zbMATH DE number 1696648 (Why is no real title available?)
- Simultaneous embeddings of graphs as median and antimedian subgraphs
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- Locating an obnoxious line among planar objects
- Locating an obnoxious facility on a euclidean network to minimize neighborhood damage
- Locating an obnoxious line among planar objects
- A branch-and-bound method for absolute value programs
- OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS
- Finding an Euclidean anti-\(k\)-centrum location of a set of points
- Maximizing the number of obnoxious facilities to locate within a bounded region
- Solving a maximin location problem on the plane with given accuracy
- On the remoteness function in median graphs
- On the ordered anti-Weber problem for any norm in \(\mathbb R^2\)
This page was built for publication: Locating two obnoxious facilities using the weighted maximin criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583716)
