General approach to estimating the complexity of postoptimality analysis for discrete optimization problems (Q1957000): 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/s10559-010-9206-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2041528445
@@ Property / OpenAlex ID: W2041528445 / 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 @@
+Q4377042
@@ Property / cites work: Q4377042 / rank @@
+Normal rank
@@ Property / cites work @@
+Some concepts of stability analysis in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+On a quantitative measure of stability for a vector problem in integer programming
+Normal rank
@@ Property / cites work @@
+On the complexity of postoptimality analysis of \(0/1\) programs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank