Approximating the stability region for binary mixed-integer programs (Q833592): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2009.04.001
@@ Property / DOI: 10.1016/j.orl.2009.04.001 / rank @@
-Normal rank
@@ 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.1016/j.orl.2009.04.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2109462722
@@ Property / OpenAlex ID: W2109462722 / rank @@
+Normal rank
@@ Property / cites work @@
+Some concepts of stability analysis in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
+Normal rank
@@ Property / cites work @@
+SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
+Normal rank
@@ Property / cites work @@
+Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
+Normal rank
@@ Property / cites work @@
+The value function of an integer program
@@ Property / cites work: The value function of an integer program / rank @@
+Normal rank
@@ Property / cites work @@
+Three methods for postoptimal analysis in integer linear programming
+Normal rank
@@ Property / cites work @@
+Sensitivity Analysis for Branch and Bound Integer Programming
+Normal rank
@@ Property / cites work @@
+Calculation of stability radii for combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+On the complexity of postoptimality analysis of \(0/1\) programs
+Normal rank
@@ Property / cites work @@
+Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2009.04.001
@@ Property / DOI: 10.1016/J.ORL.2009.04.001 / rank @@
+Normal rank