Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Steven Chamberland
Information about the author Steven Chamberland will soon be added to the site.
Found
11 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Efficient solution of the 3G network planning problem
2012
The 3G universal mobile telecommunications system (UMTS) planning problem is...
Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure
2010
This paper presents an approach to estimate the cycle time of a multi‐product...
On the expansion problem of reliable internet protocol networks with performance guarantees
2005
In this paper, we tackle the problem of how to expand Internet protocol (IP) networks...
Point of presence design in Internet protocol networks with performance guarantees
2005
In this paper, we propose a model for the point of presence (POP) design problem in...
Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths
2005
In this paper, we tackle the routing and wavelength assignment problem for wavelength...
On the overlay network design problem for the soft-label switched paths in Internet protocol networks
2003
In this paper, we tackle the design problem of the network overlay used by the...
An efficient heuristic for the expansion problem of cellular wireless networks
2004
In this paper we propose a model for the expansion problem of the network subsystem of...
On the design problem of multitechnology networks
2001
In this article we propose a model for the topological design problem of...
Topological expansion of multiple-ring metropolitan area networks
2000
This paper presents a mixed 0–1 linear programming model for the metropolitan...
On the design problem of multitechnology networks
2001
In this article we propose a model for the topological design problem of...
Topological design of two-level telecommunication networks with modular switches
2000
In this article we propose a mixed 0–1 linear programming model for the...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers