Interval data minmax regret network optimization problems (Q1827805): Difference between revisions

@@ Property / author @@
-Vasilij N. Lebedev
@@ Property / author: Vasilij N. Lebedev / rank @@
-Normal rank
@@ Property / author @@
+Vasilij N. Lebedev
@@ Property / author: Vasilij N. Lebedev / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Minmax regret solutions for minimax optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753722
@@ Property / cites work: Q2753722 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+Robust Optimization of Large-Scale Systems
@@ Property / cites work: Robust Optimization of Large-Scale Systems / rank @@
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1827805