New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519): Difference between revisions

@@ Property / cites work @@
+Q4325280
@@ Property / cites work: Q4325280 / rank @@
+Normal rank
@@ Property / cites work @@
+Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3425132
@@ Property / cites work: Q3425132 / rank @@
+Normal rank
@@ Property / cites work @@
+Using a Hop-Constrained Model to Generate Alternative Communication 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 @@
+Q5294063
@@ Property / cites work: Q5294063 / rank @@
+Normal rank
@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+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 @@
+Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
+Normal rank
@@ Property / cites work @@
+The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
+Normal rank
@@ Property / cites work @@
+A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Modeling and solving the rooted distance-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner tree problems
@@ Property / cites work: Steiner tree problems / rank @@
+Normal rank
@@ Property / cites work @@
+Design of Survivable Networks: A survey
@@ Property / cites work: Design of Survivable Networks: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Packet Routing in Telecommunication Networks with Path and Flow Restrictions
+Normal rank
@@ Property / cites work @@
+Q3760270
@@ Property / cites work: Q3760270 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+New formulations and solution procedures for the hop constrained network design problem.
+Normal rank
@@ Property / cites work @@
+On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
+Normal rank