Locating Objects in the Plane Using Global Optimization Techniques

We address the problem of locating objects in the plane such as segments, arcs of circumferences, arbitrary convex sets, their complements or their boundaries. Given a set of points, we seek the rotation and translation for such an object optimizing a very general performance measure, which includes...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematics of operations research Ročník 34; číslo 4; s. 837 - 858
Hlavní autoři: Blanquero, Rafael, Carrizosa, Emilio, Hansen, Pierre
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum INFORMS 01.11.2009
Institute for Operations Research and the Management Sciences
Témata:
Algorithms
Analysis
Approximation
Branch & bound algorithms
Circumferences
computational metrology
DC optimization
Geometric planes
global optimization
location of objects
Location theory
Mathematical functions
Mathematical objects
Mathematical optimization
Mathematical sets
Objective functions
Optimization techniques
Studies
Vertices
United States
ISSN:0364-765X, 1526-5471
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We address the problem of locating objects in the plane such as segments, arcs of circumferences, arbitrary convex sets, their complements or their boundaries. Given a set of points, we seek the rotation and translation for such an object optimizing a very general performance measure, which includes as a particular case the classical objectives in semi-obnoxious facility location. In general, the above-mentioned model yields a global optimization problem, whose resolution is dealt with using difference of convex (DC) techniques such as outer approximation or branch and bound.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0364-765X
1526-5471
DOI:10.1287/moor.1090.0406