𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch and cut algorithm for the Steiner problem in graphs

✍ Scribed by Lucena, A.; Beasley, J. E.

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
165 KB
Volume
31
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we consider the Steiner problem in graphs, which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraints given previously in the literature. We strengthen this SST formulation and present a branch and cut algorithm to solve the problem to optimality. This algorithm incorporates reduction tests and is used to solve a number of problems drawn from the literature. A number of general issues relating to branch and cut algorithms are also highlighted.

πŸ“œ SIMILAR VOLUMES

A branch-and-cut algorithm for solving g
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
✍ Suhl, Uwe H.; Hilbert, Heinrich πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 163 KB πŸ‘ 1 views

Given is an undirected graph with positive or negative edge weights which represent a profit if an investment such as installing a gas pipe takes place in a given time period. A certain part of the graph may already be piped in previous periods. The task is to extend the piped subgraph in the most p

A branch-and-cut algorithm for the undir
A branch-and-cut algorithm for the undirected selective traveling salesman problem
✍ Gendreau, Michel; Laporte, Gilbert; Semet, FrοΏ½dοΏ½ric πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 120 KB πŸ‘ 1 views

The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits are associated with vertices and costs are associated with edges. Some vertices are compulsory. The aim is to construct a tour of maximal profit including all compulsory vertices and whose cost does not exceed a p

A branch-and-cut algorithm for the resou
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
✍ Fischetti, Matteo; Vigo, Daniele πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 1 views

In this paper, we present a branch-and-cut algorithm for the exact solution of an NP-hard extension of the well-known Minimum-Weight Arborescence (MWA) problem, in which resource constraints for each node are considered. This Resource-Constrained Minimum-Weight Arborescence (RMWA) problem arises, e.

Tabu search for the Steiner problem in g
Tabu search for the Steiner problem in graphs
✍ Celso C. Ribeiro; MaurΓ­cio C. De Souza πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 1 views

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o

A branch-and-cut algorithm for solving a
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
✍ Lee, Youngho; Sherali, Hanif D.; Han, Junghee; Kim, Seong-in πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 133 KB πŸ‘ 1 views

In this paper, we deal with a network design problem arising from the deployment of synchronous optical networks (SONET), a standard of transmission using optical fiber technology. The problem is to find an optimal clustering of traffic demands in the network such that the total number of node assig