✦ LIBER ✦

Solution of combinatorial optimization problems with minimax criterion

✍ Scribed by M. K. Kravtsov; A. Kh. Sherman

Publisher: Springer US
Year: 1990
Tongue: English
Weight: 961 KB
Volume: 25
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069994

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimax criterion and some applications

Minimax criterion and some applications in optimal control problems

✍ A. I. Sotskov 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 538 KB

An ε-approximation scheme for combinator

An ε-approximation scheme for combinatorial optimization problems with minimum variance criterion

✍ Naoki Katoh 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 868 KB

Numerical solution of minimax problems o

Numerical solution of minimax problems of optimal control, part 1

✍ A. Miele; B. P. Mohanty; P. Venkataraman; Y. M. Kuo 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 777 KB

Convergence of a simulation method for s

Convergence of a simulation method for solution of combinatorial optimization problems

✍ L. F. Gulyanitskii; L. B. Koshlai; I. V. Sergienko 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 339 KB

Domination analysis of combinatorial opt

Domination analysis of combinatorial optimization problems

✍ Gregory Gutin; Alek Vainshtein; Anders Yeo 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 141 KB

We use the notion of domination ratio introduced by Glover and Punnen in 1997 to present a new classiÿcation of combinatorial optimization (CO) problems: DOM-easy and DOM-hard problems. It follows from results already proved in the 1970s that min TSP (both symmetric and asymmetric versions) is DOM-e

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