An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103): Difference between revisions

@@ Property / author @@
-Cheng, T. C. Edwin
@@ Property / author: Cheng, T. C. Edwin / rank @@
-Normal rank
@@ Property / author @@
+Cheng, T. C. Edwin
@@ Property / author: Cheng, T. C. Edwin / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+AMPL
@@ Property / describes a project that uses: AMPL / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A bicriterion approach to time/cost trade-offs in sequencing
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+A survey of results for sequencing problems with controllable processing times
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0305-0548(02)00065-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2138886673
@@ Property / OpenAlex ID: W2138886673 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1867103