𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Arithmetic problems of combinatorial analysis

✍ Scribed by A. I. Pavlov

Publisher
SP MAIK Nauka/Interperiodica
Year
1994
Tongue
English
Weight
236 KB
Volume
55
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Problem in combinatorial analysis
Problem in combinatorial analysis
✍ S. S. Kisiitsyn πŸ“‚ Article πŸ“… 1968 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 194 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

Combinatorial Isols and the Arithmetic o
Combinatorial Isols and the Arithmetic of Dekker Semirings
✍ Thomas G. McLaughlin πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 295 KB

In his long and illuminating paper Joe Barback defined and showed to be non-vacuous a class of infinite regressive isols he has termed "completely torre" (CT) isols. These particular isols all enjoy a property that Barback has since labelled combinatoriality. In , he provides a list of properties c