IV-matching is strongly NP-hard.

Lukas Folwarczny Dusan Knop

Published in: CoRR (2015)

Keyphrases

strongly np hard
scheduling problem
graph matching
np hard
branch and bound algorithm
setup times
permutation flowshop
genetic algorithm
resource allocation
identical parallel machines