Sciweavers

2343 search results - page 112 / 469
» The Locomotive Routing Problem
Sort
View
IPPS
1997
IEEE
14 years 2 months ago
Broadcasting and Multicasting in Cut-through Routed Networks
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
Johanne Cohen, Pierre Fraigniaud, Jean-Claude K&ou...
JSAC
2006
88views more  JSAC 2006»
13 years 10 months ago
Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks
This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converter...
Nina Skorin-Kapov
EOR
2007
147views more  EOR 2007»
13 years 10 months ago
Routing and wavelength assignment in optical networks using bin packing based algorithms
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
Nina Skorin-Kapov
ESWA
2006
182views more  ESWA 2006»
13 years 10 months ago
Improved route planning and scheduling of waste collection and transport
The collection of waste is a highly visible and important municipal service that involves large expenditures. Waste collection problems are, however, one of the most difficult ope...
Teemu Nuortio, Jari Kytöjoki, Harri Niska, Ol...
MFCS
2005
Springer
14 years 3 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta