๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Solving large Steiner Triple Covering Problems

โœ Scribed by James Ostrowski; Jeff Linderoth; Fabrizio Rossi; Stefano Smriglio

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
316 KB
Volume
39
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Solving hard set covering problems
Solving hard set covering problems
โœ Carlo Mannino; Antonio Sassano ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 357 KB
Covering Graphs: The Covering Problem So
Covering Graphs: The Covering Problem Solved
โœ Yair Caro; Raphael Yuster ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 238 KB

For every fixed graph H, we determine the H-covering number of K n , for all n>n 0 (H ). We prove that if h is the number of edges of H, and gcd(H )=d is the greatest common divisor of the degrees of H, then there exists n 0 =n 0 (H ), such that for all n>n 0 , Our main tool in proving this result

Solving Steiner tree problems in graphs
Solving Steiner tree problems in graphs to optimality
โœ Koch, T.; Martin, A. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 261 KB ๐Ÿ‘ 2 views

In this paper, we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms, and primal heuristics. We are able to solve nea