Sciweavers

4377 search results - page 124 / 876
» Mass problems and randomness
Sort
View
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
15 years 12 months ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick
FSTTCS
2006
Springer
15 years 10 months ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
15 years 10 months ago
Multi-objective test problems, linkages, and evolutionary methodologies
Existing test problems for multi-objective optimization are criticized for not having adequate linkages among variables. In most problems, the Pareto-optimal solutions correspond ...
Kalyanmoy Deb, Ankur Sinha, Saku Kukkonen
COR
2006
94views more  COR 2006»
15 years 6 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...
COR
2007
112views more  COR 2007»
15 years 6 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...