论文信息 - Optimization Parallelizing for Discrete Programming Problems - 字舞流文

Optimization Parallelizing for Discrete Programming Problems

Parallelizing of calculations is considered when discrete optimization problems are solved. A version of parallelizing of copies of an algorithm is proposed and analyzed. The results of computational experiments are given.

I. V. Sergienko | V. P. Shilo | V. A. Roshchin

[1] I. V. Sergienko,et al. Random decomposition of 0-1 linear integer programming problems and automatic choice of algorithms , 1994 .

[2] V. P. Shilo. The method of global equilibrium search , 1999 .

[3] V. P. Shilo. Results of an experimental investigation of the efficiency of the global-equilibrium-search method , 1999 .

[4] Per S. Laursen. Parallel heuristic search - Introductions and a new approach , 1996, Solving Combinatorial Optimization Problems in Parallel.

[5] I. V. Sergienko,et al. RESTART Technology for Solving Discrete Optimization Problems , 2000 .

[6] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.