Sciweavers

85 search results - page 13 / 17
» On the sum-of-squares algorithm for bin packing
Sort
View
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
15 years 2 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria
JCO
2006
83views more  JCO 2006»
14 years 10 months ago
Separating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
IPCO
2004
144views Optimization» more  IPCO 2004»
14 years 11 months ago
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
R. Ravi, Amitabh Sinha
EOR
2006
83views more  EOR 2006»
14 years 10 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
IJES
2006
110views more  IJES 2006»
14 years 10 months ago
Partitioning bin-packing algorithms for distributed real-time systems
Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. W...
Dionisio de Niz, Raj Rajkumar