Brunilde Sansò

Retour

Cahiers du GERAD

121 résultats — page 6 de 7

ATM (Asynchronous Transfer Mode) is a new technology recently chosen by the ITU-T standard for broadband networks. Being a powerful and yet complex techno...

référence BibTeX
et

For many years banks designed their promotional efforts to aim at the broadest possible markets in hopes of recruiting new clients. Recently, competitive me...

référence BibTeX
, et

The Steiner Tree Problem in graphs (STP) is well known NP-Hard problem. It has regained attention due to the introduction of new telecommunication technolog...

référence BibTeX
et

In this article we propose a model for the topological design problem of two-level multitechnology telecommunication networks that includes the optimal loca...

référence BibTeX
et

This paper deals with the problem of how to update a telecommunication network economically. We first propose a mixed integer programming model that include...

référence BibTeX
et

Multi-commodity flow models are well known and have been widely used in the design of packet-switched networks. They have also been used as approximations ...

référence BibTeX
et

This paper presents a framework to assess a performability measure in a urban transportation network given the possibility of an accident condition. This fr...

référence BibTeX
et

Managing redundant information is becoming an important issue in today's increasingly large distributed computer networks. As total redundancy is extremely ...

référence BibTeX
et

This paper presents a scenario-oriented optimization model and solution algorithm to solve the joint routing/capacity assignment problem for computer networ...

référence BibTeX
et

In a subway system, when a train leaves one station to go to another power consumption increases and, at one point, reaches a peak. When such peaks occur s...

référence BibTeX
, et

We consider a model for communications network design that includes the optimal location of switches (of which there are several types) and the design of th...

référence BibTeX
, et

We present several versions of a tabu search algorithm for the Steiner tree problem in graphs. A basic tabu search heuristic and versions with radical and/...

référence BibTeX
et

The paper presents three parallel versions of a column generation software applied to very large airline planning problems. The algorithms were implemented...

référence BibTeX
, et

In this paper we tackle the problem of jointly finding the optimal location of the ATM switches, the topology of the backbone and local access networks, the...

référence BibTeX
, et

Routing models for packet-switched networks have traditionally been based on the assumption that the offered traffic is Poisson. This is unrealistic since ...

référence BibTeX
et

This paper presents the problem of optimally dimensioning a new geographically distributed computer system that handles all communications between aircraft ...

référence BibTeX
et

In this paper we propose a scenario-oriented optimization model and solution algorithm to assess the capacity and the routing of computer networks. The adva...

référence BibTeX
, et

Multi-commodity flow models are well known and have been widely used in the design of packet-switched networks. Flow models have also been proposed for the ...

référence BibTeX
et

One important issue being addressed in the design of Distributed Computer Networks is how to increase the availability of time-changing information even in ...

référence BibTeX
, , , , et

The Airline Crew Scheduling Problem can be defined as the problem of finding a set of feasible rotations so that the total cost is minimum and all the fligh...

référence BibTeX