An alternative approach for proving the NP-hardness of optimization problems
T.C.E. Cheng, Y. Shafransky, C.T. Ng
| Year of publication: |
2016
|
|---|---|
| Authors: | Cheng, T. C. E. ; Shafransky, Y. ; Ng, C. T. |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 248.2016, 1 (1.1.), p. 52-58
|
| Subject: | Combinatorial optimization | Computational complexity | Scheduling | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2015.06.076 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011434691