Efficient computation of tolerances in the weighted independent set problem for trees (Q378171): Difference between revisions

@@ Property / author @@
-Q373206
@@ Property / author: Q373206 / rank @@
-Normal rank
@@ Property / author @@
-Dmitriy S. Malyshev
@@ Property / author: Dmitriy S. Malyshev / rank @@
-Normal rank
@@ Property / author @@
-Panos M. Pardalos
@@ Property / author: Panos M. Pardalos / rank @@
-Normal rank
@@ Property / author @@
+Boris I. Goldengorin
@@ Property / author: Boris I. Goldengorin / rank @@
+Normal rank
@@ Property / author @@
+Dmitriy S. Malyshev
@@ Property / author: Dmitriy S. Malyshev / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Three-Index Assignment Problem
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal time algorithm for finding a maximum weight independent set in a tree
+Normal rank
@@ Property / cites work @@
+Lower tolerance-based branch and bound algorithms for the ATSP
+Normal rank
@@ Property / cites work @@
+Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
+Normal rank
@@ Property / cites work @@
+Arc tolerances in shortest path and network flow problems
+Normal rank
@@ Property / cites work @@
+Tolerance-based branch and bound algorithms for the ATSP
+Normal rank
@@ Property / cites work @@
+An addendum on: ``Sensitivity analysis of the optimal assignment''
+Normal rank