Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706): Difference between revisions

@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+Minmax regret solutions for minimax optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
+Normal rank
@@ Property / cites work @@
+An augmenting path method for solving linear bottleneck assignment problems
+Normal rank
@@ Property / cites work @@
+The partial sum criterion for Steiner trees in graphs and shortest paths
+Normal rank
@@ Property / cites work @@
+Algorithms for two bottleneck optimization problems
+Normal rank
@@ Property / cites work @@
+An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
+Normal rank
@@ Property / cites work @@
+Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
+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 @@
+Optimal Sequencing of a Single Machine Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Complexity of minimizing the total flow time with interval data and minmax regret criterion
+Normal rank
@@ Property / cites work @@
+Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
+Normal rank
@@ Property / cites work @@
+The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
+Normal rank
@@ Property / cites work @@
+The computational complexity of the relative robust shortest path problem with interval data
+Normal rank