On linear programming duality and Landau’s characterization of tournament

Autor:	Allan B. Cruse
Rok vydání:	2014
Předmět:	Combinatorics Discrete mathematics Linear programming Electronic computers. Computer science Geography Planning and Development linear programming Tournament Linear programming duality QA75.5-76.95 landau’s theorem tournament scores Characterization (mathematics) Mathematics
Zdroj:	Acta Universitatis Sapientiae: Informatica, Vol 6, Iss 1, Pp 21-32 (2014)
ISSN:	2066-7760
Popis:	H. G. Landau has characterized those integer-sequences S = (s1, s2, . . . , sn) which can arise as score-vectors in an ordinary round-robin tournament among n contestants [17]. If s1 ≤ s2 ≤ · · · ≤ sn, the relevant conditions are expressed simply by the inequalities
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad7afd590ab40bfa422d02f69d4cb50e https://doi.org/10.2478/ausi-2014-0016 Zobrazit plný text záznamu