|
|||||
|
|
Popular branchings and their dual certificates |
|
| Authors: | Kavitha Telikepalli Király Tamás Matuschke Jannik Schlotter Ildikó Schmidt-Kraepelin Ulrike |
| Institution: | 1.TIFR, Mumbai, India ;2.E?tv?s University, Budapest, Hungary ;3.Research Center for Operations Management, KU Leuven, Leuven, Belgium ;4.Centre for Economic and Regional Studies, Budapest, Hungary ;5.Budapest University of Technology and Economics, Budapest, Hungary ;6.Research Group Efficient Algorithms, Technische Universit?t Berlin, Berlin, Germany ; |
| Abstract: | Mathematical Programming - Let G be a digraph where every node has preferences over its incoming edges. The preferences of a node extend naturally to preferences over branchings, i.e., directed... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |