A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2005.02.060
+Normal rank
@@ Property / OpenAlex ID @@
+W2067999800
@@ Property / OpenAlex ID: W2067999800 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+Partitioning procedures for solving mixed-variables programming problems
+Normal rank
@@ Property / cites work @@
+A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
+Normal rank
@@ Property / cites work @@
+Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
+Normal rank
@@ Property / cites work @@
+Generalized Benders decomposition
@@ Property / cites work: Generalized Benders decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity Distribution System Design by Benders Decomposition
+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 @@
+Q4851642
@@ Property / cites work: Q4851642 / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Tailoring Benders decomposition for uncapacitated network design
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
+Normal rank
@@ Property / cites work @@
+A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the robust shortest path problem with interval data
+Normal rank
@@ Property / cites work @@
+The robust shortest path problem with interval data via Benders decomposition
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the robust shortest path problem with interval data.
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+On the robust shortest path problem.
@@ Property / cites work: On the robust shortest path problem. / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of the relative robust shortest path problem with interval data
+Normal rank