Sciweavers

78 search results - page 2 / 16
» Differential Approximation for Some Routing Problems
Sort
View
CIMCA
2005
IEEE
13 years 11 months ago
A GRASP with Adaptive Memory for a Period Vehicle Routing Problem
We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem diffe...
Luciana B. Goncalves, Luiz Satoru Ochi, Simone L. ...
INFOCOM
2010
IEEE
13 years 4 months ago
Reliable Adaptive Multipath Provisioning with Bandwidth and Differential Delay Constraints
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...
Weiyi Zhang, Jian Tang, Chonggang Wang, Shanaka de...
MFCS
2005
Springer
13 years 11 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
WSC
2008
13 years 7 months ago
The mathematics of continuous-variable simulation optimization
Continuous-variable simulation optimization problems are those optimization problems where the objective function is computed through stochastic simulation and the decision variab...
Sujin Kim, Shane G. Henderson
ICCSA
2004
Springer
13 years 11 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson