𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Domination analysis of combinatorial opt
✍ 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