A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for extensible bin packing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Adaptive Multiuser Online Reconfigurable Engine
IEEE Design & Test
Configuration of distributed message converter systems
Performance Evaluation
Approximation Algorithms for Extensible Bin Packing
Journal of Scheduling
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
Computers and Operations Research
A classification scheme for bin packing theory
Acta Cybernetica
A fast asymptotic approximation scheme for bin packing with rejection
Theoretical Computer Science
Heuristics for the variable sized bin-packing problem
Computers and Operations Research
The train delivery problem: vehicle routing meets bin packing
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Relaxations and exact solution of the variable sized bin packing problem
Computational Optimization and Applications
Variable neighbourhood search for the variable sized bin packing problem
Computers and Operations Research
AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
SIAM Journal on Optimization
The entropy rounding method in approximation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Variable sized online interval coloring with bandwidth
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Vector bin packing with multiple-choice
Discrete Applied Mathematics
A bin packing problem with over-sized items
Operations Research Letters
An improved approximation scheme for variable-sized bin packing
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Fast asymptotic FPTAS for packing fragmentable items with costs
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A fast asymptotic approximation scheme for bin packing with rejection
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |