Applying mod-k-cuts for solving linear ordering problems |
| |
| Authors: | M Oswald G Reinelt H Seitz |
| |
| Institution: | (1) Institute of Computer Science, University of Heidelberg, Im Neuenheimer Feld 368, 69120 Heidelberg, Germany |
| |
| Abstract: | The linear ordering problem consists of finding an ordering of the nodes of the weighted complete digraph on n nodes such that the sum of the weights of the arcs compatible with the ordering is maximized. In this paper, we report about
the usefulness of mod-k cuts in a branch-and-cut algorithm for solving linear ordering problems to optimality.
|
| |
| Keywords: | Linear ordering problem Branch-and-cut Mod-k cuts |
| 本文献已被 SpringerLink 等数据库收录！ |
