Pages that link to "Item:Q4808431"
From MaRDI portal
The following pages link to Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees (Q4808431):
Displaying 35 items.
- Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- Greedy heuristics for the diameter-constrained minimum spanning tree problem (Q844529) (← links)
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees (Q863567) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Container shipping service selection and cargo routing with transshipment limits (Q1694945) (← links)
- A new extended formulation of the generalized assignment problem and some associated valid inequalities (Q2009013) (← links)
- Exact approaches for the minimum subgraph diameter problem (Q2108148) (← links)
- Finding bounded diameter minimum spanning tree in general graphs (Q2147109) (← links)
- A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933) (← links)
- The two-level diameter constrained spanning tree problem (Q2340278) (← links)
- Finding outbreak trees in networks with limited information (Q2357924) (← links)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
- Approximating \(k\)-hop minimum-spanning trees (Q2488210) (← links)
- On the characterization of the domination of a diameter-constrained network reliability model (Q2500537) (← links)
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs (Q2819269) (← links)
- Solving diameter-constrained minimum spanning tree problems by constraint programming (Q3002550) (← links)
- Angle-Restricted Steiner Arborescences for Flow Map Layout (Q3104619) (← links)
- Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem (Q3503535) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
- A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications (Q4918246) (← links)
- An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (Q5247677) (← links)
- Integer models and upper bounds for the 3‐club problem (Q5326766) (← links)
- Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity (Q5326888) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
- Models for a Steiner ring network design problem with revenues (Q5943555) (← links)
- Ordered scheduling in control-flow distributed transactional memory (Q6196835) (← links)
