Minimum Cost Hyperassignments with Applications to ICE/IC Rotation Planning

DOI10.1007/978-3-642-29210-1_10zbMath1306.90073OpenAlexW1544523010MaRDI QIDQ5176281

Olga Heismann, Ralf Borndörfer

Publication date: 3 March 2015

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29210-1_10

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (2)

A Hypergraph Network Simplex Algorithm ⋮ The hypergraph assignment problem

This page was built for publication: Minimum Cost Hyperassignments with Applications to ICE/IC Rotation Planning