Exact solution approaches for the multi-period degree constrained minimum spanning tree problem
From MaRDI portal
Publication:724056
DOI10.1016/j.ejor.2018.05.010zbMath1403.90632OpenAlexW2800114006MaRDI QIDQ724056
Alexandre Salles da Cunha, Cristiano Arbex Valle, Rosklin Juliano Chagas
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.010
Programming involving graphs or networks (90C35) Trees (05C05) Integer programming (90C10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
- Incremental network design with shortest paths
- Network construction problems with due dates
- Incremental network design with maximum flows
- Non delayed relax-and-cut algorithms
- A multiperiod degree constrained minimal spanning tree problem
- Branching rules revisited
- A multiperiod planning model for the capacitated minimal spanning tree problem
- Using Lagrangian dual information to generate degree constrained spanning trees
- Incremental Network Design with Minimum Spanning Trees
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Reducibility among Combinatorial Problems
- Optimum branchings
- Benchmarking optimization software with performance profiles.
This page was built for publication: Exact solution approaches for the multi-period degree constrained minimum spanning tree problem
