@misc{BorndoerferHeismann, author = {Bornd{\"o}rfer, Ralf and Heismann, Olga}, title = {The Hypergraph Assignment Problem}, issn = {1438-0064}, doi = {10.1016/j.disopt.2014.11.002}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-14822}, abstract = {The hypergraph assignment problem (HAP) is the generalization of assignments from directed graphs to directed hypergraphs. It serves, in particular, as a universal tool to model several train composition rules in vehicle rotation planning for long distance passenger railways. We prove that even for problems with a small hyperarc size and hypergraphs with a special partitioned structure the HAP is NP-hard and APX-hard. Further, we present an extended integer linear programming formulation which implies, e. g., all clique inequalities.}, language = {en} }