Integer Programming: Optimization and Evaluation Are Equivalent (Q3183481): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-03367-4_45
+Normal rank
@@ Property / OpenAlex ID @@
+W2137796293
@@ Property / OpenAlex ID: W2137796293 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59592348
@@ Property / Wikidata QID: Q59592348 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Calculation of stability radii for combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems
+Normal rank
@@ Property / cites work @@
+The complexity of pure Nash equilibria
@@ Property / cites work: The complexity of pure Nash equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+Q4871776
@@ Property / cites work: Q4871776 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4461908
@@ Property / cites work: Q4461908 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column
@@ Property / cites work: The NP-completeness column / rank @@
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Local Search in Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Local Search Problems that are Hard to Solve
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming
+Normal rank
@@ Property / cites work @@
+On the complexity of postoptimality analysis of \(0/1\) programs
+Normal rank