Sciweavers

2489 search results - page 116 / 498
» On the Subgroup Distance Problem
Sort
View
ANOR
2011
214views more  ANOR 2011»
14 years 11 months ago
A hybrid constraint programming approach to the log-truck scheduling problem
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
Nizar El Hachemi, Michel Gendreau, Louis-Martin Ro...
DISOPT
2011
201views Education» more  DISOPT 2011»
14 years 7 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
WADS
2007
Springer
184views Algorithms» more  WADS 2007»
15 years 10 months ago
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanj...
GECCO
2005
Springer
15 years 9 months ago
A theoretical analysis of the HIFF problem
We present a theoretical analysis of Watson’s Hierarchicalif-and-only-if (HIFF) problem using a variety of tools. These include schema theory and course graining, the concept of...
Nicholas Freitag McPhee, Ellery Fussell Crane
COMPGEOM
2003
ACM
15 years 9 months ago
the asteroid surveying problem and other puzzles
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...