Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
type: Item
instance of: scholarly article
title: Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
zbMATH Open document ID: 1458.90599
author: Eduardo Álvarez-Miranda
author: Markus Sinnl
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6901410
zbMATH Keywords: spanning tree problems
zbMATH Keywords: integer programming
zbMATH Keywords: Lagrangian relaxation
describes a project that uses: SteinLib
MaRDI profile type: Publication
full work available at URL: j.cor.2017.01.014
OpenAlex ID: W2585703503
cites work: Optimal Upgrading Schemes for Effective Shortest Paths in Networks
cites work: A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
cites work: Upgrading Shortest Paths in Networks
cites work: Benchmarking optimization software with performance profiles.
cites work: The Steiner tree polytope and related polyhedra
cites work: The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
cites work: Q4452914
cites work: Lowering eccentricity of a tree by node upgrading
cites work: Shortest-path network interdiction
cites work: Q4952698
cites work: Solving Steiner tree problems in graphs to optimality
cites work: Improving Minimum Cost Spanning Trees by Upgrading Nodes
cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
cites work: Strong lower bounds for the prize collecting Steiner problem in graphs
cites work: Q4845371
cites work: Q3993418
cites work: Trees and Cuts
cites work: Network upgrading problems
cites work: A note on the generalized Steiner tree polytope
cites work: Edge exchanges in the degree-constrained minimum spanning tree problem
cites work: Conjugate gradient methods using quasi-Newton updates with inexact line searches
cites work: Q4254875
DOI: 10.1016/J.COR.2017.01.014
description: scientific article; zbMATH DE number 6901410