Pages that link to "Item:Q4178943"
From MaRDI portal
The following pages link to The complexity of the network design problem (Q4178943):
Displaying 50 items.
- Memory-efficient enumeration of constrained spanning trees (Q294700) (← links)
- A branch-price-and-cut algorithm for the minimum evolution problem (Q319451) (← links)
- Models and algorithms for network reduction (Q320811) (← links)
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
- Network design for time-constrained delivery using subgraphs (Q395697) (← links)
- Finding best swap edges minimizing the routing cost of a spanning tree (Q476426) (← links)
- Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Design and implementation of a decision support system for multistage investment in Chinese coal production and transportation (Q751492) (← links)
- On the balanced minimum evolution polytope (Q783026) (← links)
- Models for planning capacity expansion in local access telecommunication networks (Q806810) (← links)
- Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs (Q845678) (← links)
- On the stability properties of linear dynamic time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory (Q858295) (← links)
- On the intercluster distance of a tree metric (Q861256) (← links)
- Modelling and simulation of communications network planning (Q921954) (← links)
- On the minimum average distance spanning tree of the hypercube (Q934836) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- Communication tree problems (Q995575) (← links)
- A linear-time algorithm to compute a MAD tree of an interval graph (Q1029091) (← links)
- The tree of hubs location problem (Q1039782) (← links)
- Solving the optimal network problem (Q1135216) (← links)
- Complexity of spanning tree problems: Part I (Q1145635) (← links)
- On the complexity of edge labelings for trees (Q1161294) (← links)
- A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure (Q1184354) (← links)
- Flow network design for manufacturing systems layout (Q1197683) (← links)
- A dual ascent approach to the fixed-charge capacitated network design problem (Q1278408) (← links)
- A new optimal algorithm for backbone topology design in communications networks (Q1310214) (← links)
- Extremal values for ratios of distances in trees (Q1377615) (← links)
- The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (Q1408818) (← links)
- MAD trees and distance-hereditary graphs (Q1408821) (← links)
- Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201) (← links)
- Approximation algorithms for some optimum communication spanning tree problems (Q1566575) (← links)
- Approximation algorithms for the shortest total path length spanning tree problem (Q1582085) (← links)
- Low complexity variants of the arrow distributed directory (Q1604202) (← links)
- Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
- Modeling and optimization of buffers and servers in finite queueing networks (Q1735967) (← links)
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem (Q1762012) (← links)
- Approximation algorithms for the optimal \(p\)-source communication spanning tree (Q1887037) (← links)
- An improved algorithm for the \(k\)-source maximum eccentricity spanning trees (Q1887071) (← links)
- Multi-objective routing within large scale facilities using open finite queueing networks (Q1969895) (← links)
- On the tree conjecture for the network creation game (Q1987511) (← links)
- Exact approaches for the minimum subgraph diameter problem (Q2108148) (← links)
- Proof of a conjecture about minimum spanning tree cycle intersection (Q2172386) (← links)
- Demand-aware network designs of bounded degree (Q2189175) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm (Q2317621) (← links)
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (Q2357170) (← links)
- The zoo of tree spanner problems (Q2476246) (← links)
