By Topic

Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gruber, M. ; Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Vienna ; Raidl, G.R.

The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in network design when quality of service is of concern. We solve a strong integer linear programming formulation based on so-called jump cuts by a novel branch&cut algorithm, using various heuristics including tabu search to solve the separation problem.

Published in:

Applications and the Internet, 2008. SAINT 2008. International Symposium on

Date of Conference:

July 28 2008-Aug. 1 2008