𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimax inverse problems of minimum cuts

✍ Scribed by Maiko Shigeno

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
220 KB
Volume
39
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the minimum cut separator problem
On the minimum cut separator problem
✍ Walid Ben-Ameur; Mohamed Didi Biha πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 169 KB
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.