New Valid Inequalities for the Optimal Communication Spanning Tree Problem
From MaRDI portal
Publication:5138258
DOI10.1287/ijoc.2018.0827zbMath1448.90030OpenAlexW2939499369MaRDI QIDQ5138258
Prahalad Venkateshan, Y. K. Agarwal
Publication date: 3 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0827
Cites Work
- Unnamed Item
- Unnamed Item
- Models and algorithms for network reduction
- Lagrangean bounds for the optimum communication spanning tree problem
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- Tight bounds from a path based formulation for the tree of hub location problem
- The tree of hubs location problem
- On the spanning tree polyhedron
- Optimization, approximation, and complexity classes
- Minimum cost capacity installation for multicommodity network flows
- Approximation algorithms for some optimum communication spanning tree problems
- General network design: a unified view of combined location and network design problems
- Algorithms for the optimum communication spanning tree problem
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
- The Two Level Network Design Problem with Secondary Hop Constraints
- Optimum Communication Spanning Trees
- The complexity of the network design problem
- A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
- Exact algorithms for minimum routing cost 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
- On Optimal Solutions for the Optimal Communication Spanning Tree Problem
- Design of Survivable Networks Using Three- and Four-Partition Facets
This page was built for publication: New Valid Inequalities for the Optimal Communication Spanning Tree Problem
