A linear programming approach to increasing the weight of all minimum spanning trees
From MaRDI portal
Publication:3548723
DOI10.1002/NET.20242zbMATH Open1165.90653OpenAlexW3123050985MaRDI QIDQ3548723FDOQ3548723
Authors: Mourad Baïou, Francisco Barahona 
Publication date: 17 December 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20242
Recommendations
Linear programming (90C05) Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35)
Cites Work
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Optimal attack and reinforcement of a network
- Increasing the Weight of Minimum Spanning Trees
- A faster algorithm for computing the strength of a network
- Packing Spanning Trees
- Separating from the dominant of the spanning tree polytope
- Computing the Strength of a Graph
- Algorithms for Graphic Polymatroids and Parametrics-Sets
- Network reinforcement
- New primal and dual matching heuristics
Cited In (5)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Fast approximation of matroid packing and covering
- Increasing the Weight of Minimum Spanning Trees
- Upgrading min-max spanning tree problem under various cost functions
- A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
This page was built for publication: A linear programming approach to increasing the weight of all minimum spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548723)
