New valid inequalities for the optimal communication spanning tree problem
From MaRDI portal
Publication:5138258
Recommendations
- Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
- Network loading problem: valid inequalities from 5- and higher partitions
- Solving the optimum communication spanning tree problem
- On the weight-constrained minimum spanning tree problem
- Lagrangean bounds for the optimum communication spanning tree problem
Cites work
- A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
- A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- Algorithms for the optimum communication spanning tree problem
- Approximation algorithms for some optimum communication spanning tree problems
- Benders' partitioning approach for solving the optimal communication spanning tree problem
- Design of survivable networks using three- and four-partition facets
- Exact algorithms for minimum routing cost trees
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
- General network design: a unified view of combined location and network design problems
- Lagrangean bounds for the optimum communication spanning tree problem
- Minimum cost capacity installation for multicommodity network flows
- Models and algorithms for network reduction
- On Optimal Solutions for the Optimal Communication Spanning Tree Problem
- On the spanning tree polyhedron
- Optimization, approximation, and complexity classes
- Optimum Communication Spanning Trees
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- Steiner tree problems in computer communication networks.
- The complexity of the network design problem
- The tree of hubs location problem
- The Two Level Network Design Problem with Secondary Hop Constraints
- Tight bounds from a path based formulation for the tree of hub location problem
Cited in
(7)- Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- Benders' partitioning approach for solving the optimal communication spanning tree problem
- On Optimal Solutions for the Optimal Communication Spanning Tree Problem
- Lagrangean bounds for the optimum communication spanning tree problem
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
- The tree-of-hubs location problem with interhub stopovers
This page was built for publication: New valid inequalities for the optimal communication spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138258)
