Solving the optimum communication spanning tree problem
From MaRDI portal
Recommendations
- Benders' partitioning approach for solving the optimal communication spanning tree problem
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
- Combined column-and-row-generation for the optimal communication spanning tree problem
- Algorithms for the optimum communication spanning tree problem
- Lagrangean bounds for the optimum communication spanning tree problem
Cites work
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- A Benders decomposition approach for the locomotive and car assignment problem
- A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- A comparison of optimal methods for local access uncapacitated network design
- A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
- A survey on Benders decomposition applied to fixed-charge network design problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Algorithms for the optimum communication spanning tree problem
- An approach to a problem in network design using genetic algorithms
- Approximation algorithms for some optimum communication spanning tree problems
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- Benders decomposition for large-scale uncapacitated hub location
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Branching rules revisited
- Combined column-and-row-generation for the optimal communication spanning tree problem
- Design of Survivable Networks: A survey
- Exact algorithms for minimum routing cost trees
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
- Inequalities. A mathematical olympiad approach
- Integrated airline scheduling
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
- Lagrangean bounds for the optimum communication spanning tree problem
- Multi-Terminal Network Flows
- Multi-level facility location problems
- Multicommodity Distribution System Design by Benders Decomposition
- Network flows. Theory, algorithms, and applications.
- On Hamiltonian Circuits
- On Optimal Solutions for the Optimal Communication Spanning Tree Problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimization, approximation, and complexity classes
- Optimum Communication Spanning Trees
- Partitioning procedures for solving mixed-variables programming problems
- Practical enhancements to the Magnanti-Wong method
- Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains
- Strong formulations for network design problems with connectivity requirements
- Tailoring Benders decomposition for uncapacitated network design
- The tree of hubs location problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Tight bounds from a path based formulation for the tree of hub location problem
Cited in
(12)- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
- A minimax assignment problem in treelike communication networks
- New valid inequalities for the optimal communication spanning tree problem
- Decomposition methods for the two-stage stochastic Steiner tree problem
- On Optimal Solutions for the Optimal Communication Spanning Tree Problem
- Combined column-and-row-generation for the optimal communication spanning tree problem
- Benders' partitioning approach for solving the optimal communication spanning tree problem
- Models of random subtrees of a graph
- Lagrangean bounds for the optimum communication spanning tree problem
- Approximation algorithms for some optimum communication spanning tree problems
This page was built for publication: Solving the optimum communication spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991267)
