88 search results - page 2 / 18 » Improved Bounds and Schemes for the Declustering Problem |
DAM
2006
13 years 5 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
WEA
2010
Springer
14 years 3 days ago
2010
Springer
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...
IPPS
1997
IEEE
13 years 9 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...