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

An efficient algorithm for the minimum capacity cut problem

โœ Scribed by M. Padberg; G. Rinaldi

Publisher
Springer-Verlag
Year
1990
Tongue
English
Weight
757 KB
Volume
47
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Efficient Algorithm for Minimum-Weigh
An Efficient Algorithm for Minimum-Weight Bibranching
โœ J. Keijsper; R. Pendavingh ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB

Given a directed graph D=(V, A) and a set S V, a bibranching is a set of arcs B A that contains a v&(V "S) path for every v # S and an S&v path for every v # V "S. In this paper, we describe a primal dual algorithm that determines a minimum weight bibranching in a weighted digraph. It has running ti

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 ๐Ÿ‘ 2 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.