A branching scheme for minimum cost tournaments with regard to real-world constraints.
Dirk BriskornPublished in: J. Oper. Res. Soc. (2011)
Keyphrases
- minimum cost
- real world
- capacity constraints
- np hard
- linear relaxation
- approximation algorithms
- network flow
- spanning tree
- network flow problem
- network simplex algorithm
- constraint programming
- minimum cost flow
- search tree
- constraint satisfaction
- branch and bound
- lower and upper bounds
- edit operations
- multi objective