3433 search results - page 177 / 687 » Heuristics for a bidding problem |
171
click to vote
AUSAI
2004
Springer
15 years 12 months ago
2004
Springer
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
188
click to vote
AE
1999
Springer
15 years 11 months ago
1999
Springer
The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality ar...
152
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
142
click to vote
CCCG
2007
15 years 8 months ago
2007
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
166
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this paper a new approach to solve constrained multi-objective problems by way of evolutionary multi-objective optimization is introduced. In contrast to former evolutionary ap...