𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dispersal routes reconstruction and the minimum cost arborescence problem

✍ Scribed by Wim Hordijk; Olivier Broennimann

Book ID
113759088
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
405 KB
Volume
308
Category
Article
ISSN
0022-5193

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

An application of lagrangean decompositi
An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
✍ Monique Guignard; Moshe B. Rosenwein πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 835 KB

## Abstract The resource‐constrained minimum weighted arborescence problem, a 0‐1 integer programming model with application in hierarchical distribution network design, is introduced. Since the model is NP‐hard, an enumeration method is required to solve it to optimality. Lagrangean decomposition,

Solving the undirected minimum cost flow
Solving the undirected minimum cost flow problem with arbitrary costs
✍ A. SedeΓ±o-Noda; C. GonzΓ‘lez-MartΓ­n; S. Alonso πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 66 KB

## Abstract We address the undirected minimum cost flow problem with arbitrary arcs costs. Any optimal solution for this problem is characterized by the property that the flow of each arc with negative cost must be equal to its capacity. That is, the flow can be nonzero in both directions. This sit