Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/28893
Title: An unconstrained optimization problem is NP-hard given an oracle representation of its objective function : a technical note
Authors: Cheng, TCE 
Kovalyov, MY
Keywords: Computational complexity
Scheduling
Unconstrained optimization
Issue Date: 2002
Publisher: Pergamon Press
Source: Computers and operations research, 2002, v. 29, no. 14, p. 2087-2091 How to cite?
Journal: Computers and operations research 
Abstract: The problem of unconstrained minimization of a piecewise linear function of one variable is shown to be NP-hard given an oracle representation of the function. This result can be applied to establish the NP-hardness of the scheduling problem with controllable job processing times given an oracle representation of the scheduling cost. The computational complexity of this scheduling problem has remained unknown for more than 20 years. We consider the problem of unconstrained optimization from the perspective of classifying its computational complexity, and show that it is NP-hard. This result enables us to establish the NP-hardness of the scheduling problem with controllable job processing times, whose computational complexity status has remained unknown for a long time.
URI: http://hdl.handle.net/10397/28893
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/S0305-0548(02)00065-5
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

5
Last Week
0
Last month
0
Citations as of Jul 15, 2017

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Jul 18, 2017

Page view(s)

54
Last Week
5
Last month
Checked on Jul 9, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.