Sciweavers

2343 search results - page 321 / 469
» The Locomotive Routing Problem
Sort
View
COR
2008
124views more  COR 2008»
15 years 5 months ago
Max-min fairness in multi-commodity flows
In this paper, we provide a study of Max-Min Fair (MMF) multicommodity flows and focus on some of their applications to multi-commodity networks. We first present the theoretical ...
Dritan Nace, Nhat Linh Doan, Olivier Klopfenstein,...
DISOPT
2008
118views more  DISOPT 2008»
15 years 5 months ago
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
Asaf Levin, Michal Penn
134
Voted
JUCS
2008
153views more  JUCS 2008»
15 years 5 months ago
Bus Network Optimization with a Time-Dependent Hybrid Algorithm
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
Ana C. Olivera, Mariano Frutos, Jessica Andrea Car...
SIAMAM
2008
91views more  SIAMAM 2008»
15 years 5 months ago
A Fluid Dynamic Model for Telecommunication Networks with Sources and Destinations
This paper proposes a macroscopic fluid dynamic model dealing with the flows of information on a telecommunication network with sources and destinations. The model consists of a co...
Ciro D'Apice, Rosanna Manzo, Benedetto Piccoli
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
15 years 4 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram