A general scheme for solving an NP-hard problem in the strong sense of the scheduling theory
From MaRDI portal
Publication:2487742
DOI10.1023/B:AURC.0000019378.28352.14zbMATH Open1074.90020MaRDI QIDQ2487742
Author name not available (Why is that?)
Publication date: 8 August 2005
Published in: (Search for Journal in Brave)
No records found.
No records found.
This page was built for publication: A general scheme for solving an NP-hard problem in the strong sense of the scheduling theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487742)