Optimization Online


A linear programming approach to increasing the weight of all minimum spanning trees

Francisco Barahona (barahon***at***us.ibm.com)
Mourad Baiou (baiou***at***custsv.univ-bpclermont.fr)

Abstract: Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so that the value of all minimum spanning trees is equal to some target value. We formulate this as a combinatorial linear program and give an algorithm.

Keywords: Minimum weight spanning trees, packing spanning trees, network reinforcement, strength problem

Category 1: Combinatorial Optimization (Graphs and Matroids )


Download: [PDF]

Entry Submitted: 01/06/2005
Entry Accepted: 01/06/2005
Entry Last Modified: 03/09/2006

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society