Toward a unified approach for the classification of NP-complete optimization problems (Q1143789): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(80)90006-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2053548601
@@ Property / OpenAlex ID: W2053548601 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133133
@@ Property / cites work: Q4133133 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3920645
@@ Property / cites work: Q3920645 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4161330
@@ Property / cites work: Q4161330 / rank @@
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Limiting recursion
@@ Property / cites work: Limiting recursion / rank @@
+Normal rank
@@ Property / cites work @@
+Q4140381
@@ Property / cites work: Q4140381 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4077442
@@ Property / cites work: Q4077442 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+A Functional Equation and its Application to Resource Allocation and Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Q4125769
@@ Property / cites work: Q4125769 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic evaluation techniques for bin packing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
+Normal rank