An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems (Q464980): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10559-011-9366-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2025873233
@@ Property / OpenAlex ID: W2025873233 / rank @@
+Normal rank
@@ Property / cites work @@
+Stability, parametric, and postoptimality analysis of discrete optimization problems
+Normal rank
@@ Property / cites work @@
+Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
+Normal rank
@@ Property / cites work @@
+Postoptimality analysis in zero‐one programming by implicit enumeration
+Normal rank
@@ Property / cites work @@
+General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
+Normal rank
@@ Property / cites work @@
+On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems
+Normal rank
@@ Property / cites work @@
+Average case completeness
@@ Property / cites work: Average case completeness / rank @@
+Normal rank
@@ Property / cites work @@
+On the theory of average case complexity
@@ Property / cites work: On the theory of average case complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Average Case Complete Problems
@@ Property / cites work: Average Case Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5724253
@@ Property / cites work: Q5724253 / rank @@
+Normal rank