✦ LIBER ✦

Convergence of a simulation method for solution of combinatorial optimization problems

✍ Scribed by L. F. Gulyanitskii; L. B. Koshlai; I. V. Sergienko

Publisher: Springer US
Year: 1993
Tongue: English
Weight: 339 KB
Volume: 29
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01125551

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergence of a random optimization met

Convergence of a random optimization method for constrained optimization problems

✍ N. Baba 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 438 KB

A thermodynamically motivated simulation

A thermodynamically motivated simulation procedure for combinatorial optimization problems

✍ R.E. Burkard; F. Rendl 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Solution of combinatorial optimization p

Solution of combinatorial optimization problems with minimax criterion

✍ M. K. Kravtsov; A. Kh. Sherman 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 961 KB

Sequential algorithm for the solution of

Sequential algorithm for the solution of problems of combinatorial optimization on permutations

✍ A. N. Khodzinskii 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 618 KB

Decomposition method of solving a class

Decomposition method of solving a class of combinatorial optimization problems

✍ V. L. Kravets; I. V. Sergienko 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 415 KB

MOSA method: a tool for solving multiobj

MOSA method: a tool for solving multiobjective combinatorial optimization problems

✍ E.L. Ulungu; J. Teghem; P.H. Fortemps; D. Tuyttens 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB 👁 2 views

The success of modern heuristics (Simulated Annealing (S.A.), Tabu Search, Genetic Algorithms, . . . ) in solving classical combinatorial optimization problems has drawn the attention of the research community in multicriteria methods. In fact, for large-scale problems, the simultaneous difficultie