NP-completeness of some optimal sequencing problems with a given grouping of elements

DOI10.1007/BF01074718zbMath0614.90049OpenAlexW1998514613MaRDI QIDQ4723552

A. K. Sannikova, Ya. M. Shafransky

Publication date: 1985

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01074718

zbMATH Keywords

permutationsequencingNP-hard

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Some simplified NP-complete graph problems

This page was built for publication: NP-completeness of some optimal sequencing problems with a given grouping of elements