Sciweavers

2657 search results - page 134 / 532
» On the complexity of hierarchical problem solving
Sort
View
COMPGEOM
1996
ACM
15 years 5 months ago
Smallest Enclosing Cylinders
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...
Elmar Schömer, Jürgen Sellen, Marek Teic...
EOR
2010
107views more  EOR 2010»
15 years 1 months ago
An optimization-based heuristic for the robotic cell problem
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
Jacques Carlier, Mohamed Haouari, Mohamed Kharbech...
116
Voted
CPAIOR
2009
Springer
15 years 8 months ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
EMO
2009
Springer
235views Optimization» more  EMO 2009»
15 years 8 months ago
Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
Abel Garcia-Najera, John A. Bullinaria
TCS
2002
15 years 1 months ago
The chords' problem
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
Alain Daurat, Yan Gérard, Maurice Nivat