\(k\)-colour partitions of acyclic tournaments

zbMath1063.05057MaRDI QIDQ1773195

Paulo Barcia, Jorge Orestes Cerdeira

Publication date: 25 April 2005

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/124648

zbMATH Keywords

NP-completepath partitionminimum cost

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Directed graphs (digraphs), tournaments (05C20)

This page was built for publication: \(k\)-colour partitions of acyclic tournaments