The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2011.07.008
@@ Property / DOI: 10.1016/j.dam.2011.07.008 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+SteinLib
@@ Property / describes a project that uses: SteinLib / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2011.07.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2146853131
@@ Property / OpenAlex ID: W2146853131 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4426341
@@ Property / cites work: Q4426341 / rank @@
+Normal rank
@@ Property / cites work @@
+Problem reduction methods and a tree generation algorithm for the steiner network problem
+Normal rank
@@ Property / cites work @@
+Solving the Steiner Tree Problem on a Graph Using Branch and Cut
+Normal rank
@@ Property / cites work @@
+Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
+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 @@
+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 @@
+A dual algorithm for the constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+Steiner tree problems
@@ Property / cites work: Steiner tree problems / rank @@
+Normal rank
@@ Property / cites work @@
+The shortest route problem with constraints
@@ Property / cites work: The shortest route problem with constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Steiner tree problems in graphs to optimality
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Q4117605
@@ Property / cites work: Q4117605 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of combinatorial optimization problems in multicast routing
+Normal rank
@@ Property / cites work @@
+A comparison of Steiner tree relaxations
@@ Property / cites work: A comparison of Steiner tree relaxations / rank @@
+Normal rank
@@ Property / cites work @@
+A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
+Normal rank
@@ Property / cites work @@
+A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
+Normal rank
@@ Property / cites work @@
+On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Q3874241
@@ Property / cites work: Q3874241 / rank @@
+Normal rank
@@ Property / cites work @@
+Preprocessing Steiner problems from VLSI layout
@@ Property / cites work: Preprocessing Steiner problems from VLSI layout / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2011.07.008
@@ Property / DOI: 10.1016/J.DAM.2011.07.008 / rank @@
+Normal rank