Geodesic
Probabilistic search with exclusions for discrete unconstrained optimization
Diskretnyj analiz i issledovanie operacij, Tome 9 (2002) no. 2, pp. 13-30.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2002_9_2_a1,
     author = {E. N. Goncharov and Yu. A. Kochetov},
     title = {Probabilistic search with exclusions for discrete unconstrained optimization},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {13--30},
     publisher = {mathdoc},
     volume = {9},
     number = {2},
     year = {2002},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2002_9_2_a1/}
}
TY  - JOUR
AU  - E. N. Goncharov
AU  - Yu. A. Kochetov
TI  - Probabilistic search with exclusions for discrete unconstrained optimization
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2002
SP  - 13
EP  - 30
VL  - 9
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2002_9_2_a1/
LA  - ru
ID  - DA_2002_9_2_a1
ER  - 
%0 Journal Article
%A E. N. Goncharov
%A Yu. A. Kochetov
%T Probabilistic search with exclusions for discrete unconstrained optimization
%J Diskretnyj analiz i issledovanie operacij
%D 2002
%P 13-30
%V 9
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2002_9_2_a1/
%G ru
%F DA_2002_9_2_a1
E. N. Goncharov; Yu. A. Kochetov. Probabilistic search with exclusions for discrete unconstrained optimization. Diskretnyj analiz i issledovanie operacij, Tome 9 (2002) no. 2, pp. 13-30. http://geodesic.mathdoc.fr/item/DA_2002_9_2_a1/

[1] Beresnev V. L., Gimadi E. X., Dementev V. T., Ekstremalnye zadachi standartizatsii, Nauka, Novosibirsk, 1978 | MR

[2] Beresnev V. L., Goncharov E. N., “Priblizhennyi algoritm dlya zadachi minimizatsii polinomov ot bulevykh peremennykh”, Diskret. analiz i issled. operatsii. Ser. 2, 5:2 (1998), 3–19 | MR | Zbl

[3] Borovkov A. A., Teoriya veroyatnostei, Nauka, M., 1986 | MR | Zbl

[4] Goncharov E. N., “Metod vetvei i granits dlya prosteishei dvukhurovnevoi zadachi razmescheniya predpriyatii”, Diskret. analiz i issled. operatsii. Ser. 2, 5:1 (1998), 19–39 | MR | Zbl

[5] Goncharov E. N., Kochetov Yu. A., “Povedenie veroyatnostnykh zhadnykh algoritmov dlya mnogostadiinoi zadachi razmescheniya”, Diskret. analiz i issled. operatsii. Ser. 2, 6:1 (1999), 12–32 | MR | Zbl

[6] Gorbachevskaya L. E., Dementev V. T., Shamardin Yu. V., “Dvukhurovnevaya zadacha standartizatsii s usloviem edinstvennosti optimalnogo potrebitelskogo vybora”, Diskret. analiz i issled. operatsii. Ser. 2, 6:2 (1999), 3–11 | MR | Zbl

[7] Kormen T., Leizerson Ch., Rivest R., Algoritmy: Postroenie i analiz, MTsNMO, M., 1999

[8] Kochetov Yu. A., “Veroyatnostnye metody lokalnogo poiska dlya zadach diskretnoi optimizatsii”, Diskretnaya matematika i ee prilozheniya, Sb. lektsii molodezhnykh i nauchnykh shkol po diskretnoi matematike i ee prilozheniyam, Izd-vo tsentra prikl. issled. pri mekh.-mat. fak. MGU, M., 2001, 84–117

[9] Aarts E. H. L., Korst J. H. M., Laarhoven P. J. M., “Simulated annealing”, Local search in combinatorial optimization, John Wiley Sons, Chichester, 1997, 91–120 | MR

[10] Aarts E. H. L., Lenstra J. K., Local search in combinatorial optimization, John Wiley Sons, Chichester, 1997 | MR

[11] Battiti R., Protasi M., “Reactive local search for maximum clique”, Proc. of Workshop on Algorithm Engineering, 1997, 74–82; http://www.dsi.unive.it/wae97/proceedings/contents.html

[12] Boese K. D., Kahng A. B., Muddu S., “A new adaptive multi-start technique for combinatorial global optimizations”, Oper. Res. Lett., 16:2 (1994), 101–113 | DOI | MR | Zbl

[13] Krarup J., Pruzan P., “The simple plant location problem: survey and synthesis”, European J. Oper. Res., 12:1 (1983), 36–81 | DOI | MR | Zbl

[14] Faigle U., Kern W., “Some convergence results for probabilistic tabu search”, ORSA J. Comput., 4:4 (1992), 32–37 | Zbl

[15] Glover F., Laguna M., Tabu search, Kluwer Acad. Publ., Boston, 1997 | MR

[16] Hertz A., Taillard E., de Werra D., “Tabu search”, Local search in combinatorial optimization, John Wiley Sons, Chichester, 1997, 121–136 | MR

[17] Reeves C. R., “Genetic algorithms for the operations researcher”, INFORMS J. Comput., 9:3 (1997), 231–250 | DOI | Zbl

[18] Schuler R., Schöning U., Watanabe O., An improved randomized algorithm for 3-SAT, Techn. Rep., Dept. of Math. and Comput. Sci. Tokyo Inst. of Technology, 2001 | MR

[19] Schumacher C., Black box search – framework and methods, Ph. D. Thesis, The Univ. of Tennessee, Knoxville, USA, 2000 | Zbl

[20] Tcha D. W., Lee B.-I., “A branch-and-bound algorithm for the multilevel uncapacitated facility location problem”, European J. Oper. Res., 18:1 (1984), 35–43 | DOI | MR | Zbl

[21] Tovey C. A., “Hill climbing with multiple local optima”, SIAM J. Algebraic and Discrete Methods, 6:3 (1985), 384–393 | DOI | MR | Zbl

[22] Wolpert D. H., Macready W. G., No free lunch theorem for search, Techn. Rep. SFI-TR-95-02-010, Santa Fe Inst., 1995 | MR