New Classes of Lower Bounds for Bin Packing Problems
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
Computers and Operations Research
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
Operations Research
The generalized bin packing problem under uncertainty
ICACM'11 Proceedings of the 2011 international conference on Applied & computational mathematics
LP bounds in various constraint programming approaches for orthogonal packing
Computers and Operations Research
Communication: The stochastic generalized bin packing problem
Discrete Applied Mathematics
A tight lower bound for optimal bin packing
Operations Research Letters
Conservative scales in packing problems
OR Spectrum
Improved bounds for hybrid flow shop scheduling with multiprocessor tasks
Computers and Industrial Engineering
Hi-index | 0.00 |
We define the class of trapdoor pseudo-random number generators, and introduce a new technique for using these in cryptography. As an application for this technique, we present a provably secure protocol for One-Bit Disclosures i.e. for giving a one-bit ...