A Lagrangian approach for minimum cost single round robin tournaments.

Dirk Briskorn Andrei Horbach

Published in: Comput. Oper. Res. (2012)

Keyphrases

minimum cost
np hard
spanning tree
network flow
approximation algorithms
network flow problem
capacity constraints
network simplex algorithm
round robin tournament
special case
integer programming
minimum cost flow
evolutionary algorithm
edit operations