-
1
-
-
84947916483
-
Formal models of heavy-tailed behavior in combinatorial search
-
Springer-Verlag, London, UK
-
H. Chen, C.P. Gomes, B. Selman, Formal models of heavy-tailed behavior in combinatorial search, in: CP '01: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, Springer-Verlag, London, UK, 2001, pp. 408-421.
-
(2001)
CP '01: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
, pp. 408-421
-
-
Chen, H.1
Gomes, C.P.2
Selman, B.3
-
4
-
-
0031630555
-
Boosting combinatorial search through randomization
-
AAAI Press, Madison, Wisconsin
-
C.P. Gomes, B. Selman, H. Kautz, Boosting combinatorial search through randomization, in: Proceedings of the 15th National Conference on Artificial Intelligence, AAAI Press, Madison, Wisconsin, 1998, pp. 431-437.
-
(1998)
Proceedings of the 15th National Conference on Artificial Intelligence
, pp. 431-437
-
-
Gomes, C.P.1
Selman, B.2
Kautz, H.3
-
5
-
-
0012306197
-
Optimal parallelization of Las Vegas algorithms
-
Springer-Verlag, London, UK
-
M. Luby, W. Ertel, Optimal parallelization of Las Vegas algorithms, in: STACS '94: Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, Springer-Verlag, London, UK, 1994, pp. 463-474.
-
(1994)
STACS '94: Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
, pp. 463-474
-
-
Luby, M.1
Ertel, W.2
-
7
-
-
17444396374
-
An advanced tabu search algorithm for the job shop problem
-
E. Nowicki, and C. Smutnicki An advanced tabu search algorithm for the job shop problem J. Scheduling 8 2 2005 145 159
-
(2005)
J. Scheduling
, vol.8
, Issue.2
, pp. 145-159
-
-
Nowicki, E.1
Smutnicki, C.2
-
8
-
-
4444246623
-
Multistart Tabu search strategies for the unconstrained binary quadratic optimization problem
-
G. Palubeckis Multistart Tabu search strategies for the unconstrained binary quadratic optimization problem J. Annals Oper. Res. 131 1-4 2004 259 282
-
(2004)
J. Annals Oper. Res.
, vol.131
, Issue.14
, pp. 259-282
-
-
Palubeckis, G.1
-
11
-
-
33747315828
-
Restart technology for solving discrete optimization problems
-
I.V. Sergienko, V.P. Shilo, and V.A. Roshchin Restart technology for solving discrete optimization problems Cybernet. Syst. Anal. 36 5 2000 659 666
-
(2000)
Cybernet. Syst. Anal.
, vol.36
, Issue.5
, pp. 659-666
-
-
Sergienko, I.V.1
Shilo, V.P.2
Roshchin, V.A.3
-
12
-
-
33751506220
-
Optimization parallelizing for discrete programming problems
-
I.V. Sergienko, V.P. Shilo, and V.A. Roshchin Optimization parallelizing for discrete programming problems Cybernet. Syst. Anal. 40 2 2004 184 189
-
(2004)
Cybernet. Syst. Anal.
, vol.40
, Issue.2
, pp. 184-189
-
-
Sergienko, I.V.1
Shilo, V.P.2
Roshchin, V.A.3
-
13
-
-
0027201278
-
Benchmarks for basic scheduling problems
-
E. Taillard Benchmarks for basic scheduling problems Eur. J. Oper. Res. 64 1993 278 285
-
(1993)
Eur. J. Oper. Res.
, vol.64
, pp. 278-285
-
-
Taillard, E.1
-
14
-
-
11244298788
-
Analysis and algorithms for restart
-
Washington, DC, USA
-
A.P.A. van Moorsel, K. Wolter, Analysis and algorithms for restart, in: QEST '04: Proceedings of the The Quantitative Evaluation of Systems, First International Conference, IEEE Computer Society, Washington, DC, USA, 2004, pp. 195-204.
-
(2004)
QEST '04: Proceedings of the the Quantitative Evaluation of Systems, First International Conference, IEEE Computer Society
, pp. 195-204
-
-
Van Moorsel, A.P.A.1
Wolter, K.2
|