High-speed local area networks and their performance: a survey
BW Abeysundara, AE Kamal - ACM Computing Surveys (CSUR), 1991 - dl.acm.org
At high data transmission rates, the packet transmission time of a local area network (LAN)
could become comparable to or less than the medium propagation delay. The performance …
could become comparable to or less than the medium propagation delay. The performance …
On the generalized minimum spanning tree problem
YS Myung, CH Lee, DW Tcha - Networks, 1995 - Wiley Online Library
This paper considers the Generalized Minimum Spanning Tree Problem (GMSTP). Given an
undirected graph whose nodes are partitioned into mutually exclusive and exhaustive node …
undirected graph whose nodes are partitioned into mutually exclusive and exhaustive node …
Logically rearrangeable multihop lightwave networks
JFP Labourdette, AS Acampora - IEEE Transactions on …, 1991 - ieeexplore.ieee.org
The optimization problem of rearrangeable multihop lightwave networks is considered. The
authors formulate the flow and wavelength assignment problem, when minimizing the …
authors formulate the flow and wavelength assignment problem, when minimizing the …
[PDF][PDF] Topological design of the wavelength-division optical network
JA Bannister, L Fratta, M Gerla - IEEE INFOCOM'90, 1990 - researchgate.net
The two-fold purpose of our research is to develop mathematical programming tools for the
optimal or near-optimal design of a new type of network architecture called the Wavelength …
optimal or near-optimal design of a new type of network architecture called the Wavelength …
An efficient strategy for using multifactorial optimization to solve the clustered shortest path tree problem
Arising from the need of all time for optimization of irrigation systems, distribution network
and cable network, Clustered Shortest-Path Tree Problem (CluSPT) has been attracting a lot …
and cable network, Clustered Shortest-Path Tree Problem (CluSPT) has been attracting a lot …
A two-level solution approach for solving the generalized minimum spanning tree problem
In this paper, we are addressing the generalized minimum spanning tree problem, denoted
by GMSTP, which is a variant of the classical minimum spanning tree (MST) problem. The …
by GMSTP, which is a variant of the classical minimum spanning tree (MST) problem. The …
[LIVRE][B] Generalized network design problems: Modeling and optimization
PC Pop - 2012 - books.google.com
Combinatorial optimization is a fascinating topic. Combinatorial optimization problems arise
in a wide variety of important fields such as transportation, telecommunications, computer …
in a wide variety of important fields such as transportation, telecommunications, computer …
[PDF][PDF] The generalized minimum spanning tree problem
PC Pop - 2002 - research.utwente.nl
I want to thank to all the people who helped me, directly and indirectly with the realization of
this thesis. First of all I want to thank my supervisors prof. U. Faigle and prof. G. Woeginger; …
this thesis. First of all I want to thank my supervisors prof. U. Faigle and prof. G. Woeginger; …
A survey of different integer programming formulations of the generalized minimum spanning tree problem
PC Pop - Carpathian Journal of Mathematics, 2009 - JSTOR
In this survey paper, we discuss the development of the Generalized Minimum Spanning
Tree Problem, denoted by GMSTP, and we focus on the integer programming formulations …
Tree Problem, denoted by GMSTP, and we focus on the integer programming formulations …
Optimal design of a two-level hierarchical network with tree-star configuration
J Kim, D Tcha - Computers & industrial engineering, 1992 - Elsevier
This paper deals with the topological design problem of a hierarchical two-level network
where the upper-level backbone network is of tree type and the lower-level local access …
where the upper-level backbone network is of tree type and the lower-level local access …