### Citations

14082 |
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ...em. In fact, simplified versions of this problem, namely the capacitated minimum spanning tree problem and the Steiner problem in graphs, which handle queueing delays implicitly, are NP-complete (see =-=Garey and Johnson, 1979-=-). In this section we present a Lagrangean relaxation of P that provides a lower bound for the problem through subgradient optimisation. 3.1. A Lagrangean relaxation of P A Lagrangean relaxation of P ... |

2207 | Data Networks
- Bertsekas, Gallager
- 1992
(Show Context)
Citation Context ...MA/CD with binary International Transactions in Operational Research Vol. 5, No. 3 215 exponential backo, according to the IEEE 802.3 standard), for small values of the t/X approximation it is good (=-=Bertsekas and Gallager, 1987-=-), and is adequate for the objectives of the present work, since it will be incorporated into a design strategy where other simplifications are necessary in order to make the process tractable. The av... |

822 | Tabu Search.
- Glover, Laguna
- 1997
(Show Context)
Citation Context ...and to allow enough flexibility (as measured by the percentage of available moves at any given iteration). Given the importance of this parameter several implementations of it have been proposed (see =-=Glover and Laguna, 1993-=-). In this paper we use a random implementation calculated as follows: tabu_tenure = tenure_min + U*(tenure_max ÿ tenure_min); where tenure_max and tenure_min are given parameters (in the test problem... |

360 |
The lagrangian relaxation method for solving integer programming problems.
- Fisher
- 2004
(Show Context)
Citation Context ...ot be used to solve the Lagrangean dual, Max{Z(M)}. A subgradient optimization procedure will be used to estimate Z(M*). Subgradient optimisation (see, for example, Held et al., 1974; Georion, 1974; =-=Fisher, 1981-=-) is an iterative procedure in which, in its k-th iteration, the updated vector of Lagrangean multipliers Mk is obtained. Using these values, the Lagrangean subproblems are solved. Based on this solut... |

164 |
Validation of subgradient optimization,”
- Held, Wolfe, et al.
- 1974
(Show Context)
Citation Context ...ssical optimization procedures cannot be used to solve the Lagrangean dual, Max{Z(M)}. A subgradient optimization procedure will be used to estimate Z(M*). Subgradient optimisation (see, for example, =-=Held et al., 1974-=-; Georion, 1974; Fisher, 1981) is an iterative procedure in which, in its k-th iteration, the updated vector of Lagrangean multipliers Mk is obtained. Using these values, the Lagrangean subproblems a... |

144 | Communication Nets: Stochastic Message Flow and Delay. - Kleinrock - 1964 |

70 | On the Topological Design of Distributed Computer Networks. - Gerla, Kleinrock - 1977 |

62 |
An Algorithm for Distributed Computation of a Spanning Tree in an Extended
- Perlman
- 1985
(Show Context)
Citation Context ... of the most commonly used devices in the interconnection of LANs. These bridges are based on a logical tree topology. Logical trees may be obtained by implementing a minimal spanning tree algorithm (=-=Perlman, 1984-=-). As the logical topology must be a tree, the physical topology must be carefully designed to avoid excessive delays in the messages that pass through the LANs. While performance analysis and protoco... |

43 |
A branch-and-cut algorithm for the Steiner problem
- Beasley
- 1998
(Show Context)
Citation Context ...ly. From (8) it follows that exactly one route must be selected for each commodity (this assumes a non-bifurcated flow). Constraints (9), (10) and (11) ensure that the topology is a Steiner tree (see =-=Beasley, 1989-=-). Constraints (9) ensure that the links chosen form a spanning tree on the augmented graph G0=(V0, L0). Constraints (10) establish that if link (0,i) i $ S is used, no link that is connected to node ... |

21 |
Topological design of computer communication net- works
- Gavish
- 1989
(Show Context)
Citation Context ...ptimisation problems and are a good introduction to the theme. Gavish (1991) and Ferreira Filho and Galvão (1994) are surveys of network design problems. The issues of Annals of Operations Research (=-=Gavish, 1992-=-a) and Operations Research (Gavish, 1995), dedicated to Operations Research in Telecommunications, provide the reader with a broad understanding of the subject. Papers that deal directly with intercon... |

18 | Topological design of interconnected LAN/MAN networks - Ersoy, Panwar - 1993 |

11 | Lagrangian relaxation for integer programming - Georion - 1974 |

8 | Large scale network topological optimization - Boorstyn, Frank - 1977 |

5 | Optimal design of LAN-WAN internetworks: an approach using simulated annealing - Fetterolf, Anandalingan - 1992 |

5 | A Lagrangean relaxation technique for optimizing interconnection of local area networks - Fetterolf, Anandalingan - 1992 |

4 |
Operations research in telecommunications
- Gavish, editor
- 1992
(Show Context)
Citation Context ...ptimisation problems and are a good introduction to the theme. Gavish (1991) and Ferreira Filho and Galvão (1994) are surveys of network design problems. The issues of Annals of Operations Research (=-=Gavish, 1992-=-a) and Operations Research (Gavish, 1995), dedicated to Operations Research in Telecommunications, provide the reader with a broad understanding of the subject. Papers that deal directly with intercon... |

4 |
Special issue on telecommunications systems: modeling, analysis and design
- Gavish
- 1995
(Show Context)
Citation Context ...oduction to the theme. Gavish (1991) and Ferreira Filho and Galvão (1994) are surveys of network design problems. The issues of Annals of Operations Research (Gavish, 1992a) and Operations Research (=-=Gavish, 1995-=-), dedicated to Operations Research in Telecommunications, provide the reader with a broad understanding of the subject. Papers that deal directly with interconnection design are: Gupta and Ross (1991... |

3 | A survey of computer network design problems - Filho, M, et al. - 1994 |

3 | Design of data networks with spanning tree bridges - Fetterolf - 1990 |

3 | Optimal design of a two-level hierarchical network with tree-star configuration - Kim, Tcha - 1992 |

2 | Future paths for integer programming and links with artificial intelligence - Glover - 1986 |

2 | Performance modeling and optimization of networks of bridged LANs. Queueing Systems 9 - Gupta, Ross - 1991 |

1 |
Special issue on LANs interconnection
- Backes
- 1988
(Show Context)
Citation Context ...caused considerable interest in the interconnection of LANs. LANs interconnection provides a way to extend the LAN environment in physical extent, number of stations, performance and reliability (see =-=Backes, 1988-=-; Bux et al., 1987; Green et al., 1990). Transparent (spanning tree) bridges (Backes, 1988) are one of the most commonly used devices in the interconnection of LANs. These bridges are based on a logic... |

1 |
Special issue on LANs interconnection
- Bux, Grillo, et al.
- 1987
(Show Context)
Citation Context ...rable interest in the interconnection of LANs. LANs interconnection provides a way to extend the LAN environment in physical extent, number of stations, performance and reliability (see Backes, 1988; =-=Bux et al., 1987-=-; Green et al., 1990). Transparent (spanning tree) bridges (Backes, 1988) are one of the most commonly used devices in the interconnection of LANs. These bridges are based on a logical tree topology. ... |

1 | Optimal design of survivable LAN-LAN networks - Clarke, Anandalingam - 1990 |

1 | Projeto Topologico de Redes de Computadores (Topological Design of Computer Networks - Filho, M - 1995 |

1 | Interconnection of local area networks with an application in the Federal University of Rio de Janeiro - Filho, M, et al. - 1995 |

1 | Optimizing interconnections of local area networks: an approach using simulated annealing - Fetterolf, Anandalingan - 1991 |

1 |
Special issue on heterogeneous computer networks interconnection
- Green, Naemura, et al.
- 1990
(Show Context)
Citation Context ...the interconnection of LANs. LANs interconnection provides a way to extend the LAN environment in physical extent, number of stations, performance and reliability (see Backes, 1988; Bux et al., 1987; =-=Green et al., 1990-=-). Transparent (spanning tree) bridges (Backes, 1988) are one of the most commonly used devices in the interconnection of LANs. These bridges are based on a logical tree topology. Logical trees may be... |

1 | Galvão—Design of Interconnection of Local Networks230 - Filho, D - 1994 |