𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bootstrap heuristic for designing minimum cost survivable networks

✍ Scribed by Lloyd W. Clarke; G. Anandalingam

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
968 KB
Volume
22
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Heuristic solutions for general concave
Heuristic solutions for general concave minimum cost network flow problems
✍ Dalila B.M.M. Fontes; JosΓ© Fernando GonΓ§alves πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 214 KB

## Abstract We address the single‐source uncapacitated minimum cost network flow problem with general concave cost functions. Exact methods to solve this class of problems in their full generality are only able to address small to medium size instances, since this class of problems is known to be N

A linear relaxation-based heuristic appr
A linear relaxation-based heuristic approach for logistics network design
✍ Phuong Nga Thanh; Olivier PΓ©ton; Nathalie Bostel πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 673 KB

## a b s t r a c t We address the problem of designing and planning a multi-period, multi-echelon, multi-commodity logistics network with deterministic demands. This consists of making strategic and tactical decisions: opening, closing or expanding facilities, selecting suppliers and defining the

A new heuristic algorithm for finding mi
A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay
✍ Anna HaΔ‡; Kelei Zhou πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 246 KB

## This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum-cost multicast tree. The heuristic depends on (1) bounded delay along paths from source nodes to each destination node; (2) minimum cost of the multicast tree; (3) dyn

On design of a survivable network archit
On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
✍ Iradj Ouveysi; Andrew Wirth πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 262 KB

We investigate network planning and design under volatile conditions of link failures and trac overload. Our model is a non-simultaneous multi-commodity problem, with any particular two link failure being considered as one scenario. We show that the optimal solution model is not practically solvable