scientific article; zbMATH DE number 1253055
From MaRDI portal
Publication:4229622
zbMath0929.90045MaRDI QIDQ4229622
Publication date: 18 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
branch-and-bounddistance constraintsobnoxious facilities\(p\) anti-center dispersion problemmaximin multiple facilities rectilinear distance location problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (8)
Location and layout planning. A survey ⋮ Solving a maximin location problem on the plane with given accuracy ⋮ Improved algorithms for placing undesirable facilities ⋮ Facility location models for distribution system design ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ Maximizing the number of obnoxious facilities to locate within a bounded region ⋮ Infrastructure development for conversion to environmentally friendly fuel ⋮ Locating two obnoxious facilities using the weighted maximin criterion
This page was built for publication:
