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

DOI10.1007/BF01074718MaRDI QIDQ4723552zbMATH OpenOpenAlexFDO

Authors 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

NP-hardpermutationsequencing

Mathematics Subject Classification ID

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

Recommendations

• NP-completeness of a combinator optimization problem
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• Adapting exact and heuristic procedures in solving an NP-hard sequencing problem
• scientific article; zbMATH DE number 1054933
• Optimal Consecutive-k-out-of-n:F Component Sequencing
• scientific article; zbMATH DE number 3848609
• On the complexity of dynamic programming for sequencing problems with precedence constraints
• Sequencing functions and optimizations on permutations of a partially ordered set
• Some NP-complete problems for hypergraph degree sequences
• On optimal algorithms for problems defined on groups

Cites work

• Some simplified NP-complete graph problems

Cited in

(6)

• Complexity of min-max subsequence problems
• Arrays of distinct representatives --- a very simple NP-complete problem
• Optimal Consecutive-k-out-of-n:F Component Sequencing
• scientific article; zbMATH DE number 3934404 (Why is no real title available?)
• Sequential-Merge Facets for Two-Dimensional Group Problems
• On an NP-hard sorting problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723552)