1182 search results - page 68 / 237 » Iterative Methods in Combinatorial Optimization |
117
click to vote
SAC
2004
ACM
15 years 7 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
121
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
110
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
128
click to vote
SIGECOM
2004
ACM
15 years 7 months ago
2004
ACM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
124
click to vote
TNN
2008
15 years 1 months ago
2008
This paper addresses the problem of the optimal design of numerical experiments for the construction of nonlinear surrogate models. We describe a new method, called learner disagre...