Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
From MaRDI portal
Publication:1652284
DOI10.1016/j.cor.2017.01.014zbMath1458.90599OpenAlexW2585703503MaRDI QIDQ1652284
Markus Sinnl, Eduardo Álvarez-Miranda
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.01.014
Related Items (5)
Upgrading nodes in tree-shaped hub location ⋮ Upgrading min-max spanning tree problem under various cost functions ⋮ Upgrading edges in the maximal covering location problem ⋮ Upgrading edges in the graphical TSP ⋮ The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conjugate gradient methods using quasi-Newton updates with inexact line searches
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- Edge exchanges in the degree-constrained minimum spanning tree problem
- The Steiner tree polytope and related polyhedra
- Strong lower bounds for the prize collecting Steiner problem in graphs
- A note on the generalized Steiner tree polytope
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Optimal Upgrading Schemes for Effective Shortest Paths in Networks
- Upgrading Shortest Paths in Networks
- Trees and Cuts
- Solving Steiner tree problems in graphs to optimality
- Shortest-path network interdiction
- Network upgrading problems
- Improving Minimum Cost Spanning Trees by Upgrading Nodes
- Lowering eccentricity of a tree by node upgrading
- Benchmarking optimization software with performance profiles.
This page was built for publication: Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
