✦ LIBER ✦

Reducing the hierarchical network design problem

✍ Scribed by Cees Duin; Anton Volgenant

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 949 KB
Volume: 39
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(89)90170-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An addendum to the hierarchical network

An addendum to the hierarchical network design problem

✍ C.W. Duin; A. Volgenant 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 216 KB

The hierarchical network design problem

The hierarchical network design problem with multiple primary paths

✍ N.G.F. Sancho 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Hierarchical networks and the subnetwork

Hierarchical networks and the subnetwork partition problem

✍ Radia Perlman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 513 KB

On hypercube-based hierarchical intercon

On hypercube-based hierarchical interconnection network design

✍ Sivarama P. Dandamudi; Derek L. Eager 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 653 KB

Hierarchical solution of network flow pr

Hierarchical solution of network flow problems

✍ Anant H. V. Lyer; John J. Jarvis; H. Donald Ratliff 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 954 KB

## Abstract Given a network flow problem and a partition of its nodes into disjoint sets, we provide an aggregation‐disaggregation procedure that reformulates the problem as the union of network flow subproblems. Each subproblem either involves nodes in a set and their induced arcs or involves node

The complexity of the network design pro

The complexity of the network design problem

✍ D. S. Johnson; J. K. Lenstra; A. H. G. Rinnooy Kan 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 278 KB