A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585): Difference between revisions

@@ Property / cites work @@
+An algorithm for the steiner problem in graphs
@@ Property / cites work: An algorithm for the steiner problem in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
+Normal rank
@@ Property / cites work @@
+The 2-hop spanning tree problem
@@ Property / cites work: The 2-hop spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
+Normal rank
@@ Property / cites work @@
+Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
+Normal rank
@@ Property / cites work @@
+Multicommodity flow models for spanning trees with hop constraints
+Normal rank
@@ Property / cites work @@
+Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q3840281
@@ Property / cites work: Q3840281 / rank @@
+Normal rank
@@ Property / cites work @@
+Packet Routing in Telecommunication Networks with Path and Flow Restrictions
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
+Normal rank