Sciweavers

14158 search results - page 215 / 2832
» Generalized switch-setting problems
Sort
View
EVOW
2005
Springer
15 years 9 months ago
Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Ker...
Jano I. van Hemert
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
15 years 8 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
143
Voted
GECCO
2010
Springer
168views Optimization» more  GECCO 2010»
15 years 7 months ago
Elementary landscapes of frequency assignment problems
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
L. Darrell Whitley, J. Francisco Chicano, Enrique ...
154
Voted
COCOON
2004
Springer
15 years 7 months ago
k-Center Problems with Minimum Coverage
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu
126
Voted
CORR
2007
Springer
120views Education» more  CORR 2007»
15 years 3 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová