5316 search results - page 47 / 1064 » Which Search Problems Are Random |
SIAMJO
2008
15 years 3 months ago
2008
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
121
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
156
click to vote
COR
2011
2011
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
14 years 10 months ago
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
136
click to vote
JCO
2007
15 years 3 months ago
2007
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
154
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...