Minimum Cost Hyperassignments with Applications to ICE/IC Rotation Planning.

Olga Heismann Ralf Borndörfer

Published in: OR (2011)

Keyphrases

minimum cost
np hard
approximation algorithms
network flow problem
network flow
spanning tree
capacity constraints
network simplex algorithm
minimum cost flow
edit operations
integrated circuit
integer programming
minimum cost path