✦ LIBER ✦

A k-partite assignment problem

✍ Scribed by Narula, Subhash; Ogbu, Ugonnaya

Book ID: 122758186
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 116 KB
Volume: 8
Category: Article
ISSN: 0305-0483
DOI: 10.1016/0305-0483(80)90048-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Restricted k-partite partitions

✍ D. P. Roselle 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 338 KB

Packing k-partite k-uniform hypergraphs

✍ Richard Mycroft 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 178 KB

k-Partitioning problems with partition m

k-Partitioning problems with partition matroid constraint

✍ Biao Wu; Enyue Yao 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 214 KB

A set partitioning heuristic for the gen

A set partitioning heuristic for the generalized assignment problem

✍ Dirk.G. Cattrysse; Marc Salomon; Luk N. Van Wassenhove 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Graph partitions for the multidimensiona

Graph partitions for the multidimensional assignment problem

✍ Vogiatzis, Chrysafis; Pasiliao, Eduardo L.; Pardalos, Panos M. 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 882 KB

Kings in k-partite tournaments

✍ Vojislav Petrovic; Carsten Thomassen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Petrovic, V. and C. Thomassen, Kings in k-partite tournaments, Discrete Mathematics 98 (1991) 237-238. We prove that every k-partite tournament with at most one vertex of in-degree zero contains a vertex from which each other vertex can be reached in at most four steps.