Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem
Journal of Heuristics
Adaptive Multiuser Online Reconfigurable Engine
IEEE Design & Test
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Configuration of distributed message converter systems
Performance Evaluation
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
Computers and Operations Research
Solving the variable size bin packing problem with discretized formulations
Computers and Operations Research
A fast asymptotic approximation scheme for bin packing with rejection
Theoretical Computer Science
Bin packing with controllable item sizes
Information and Computation
Heuristics for the variable sized bin-packing problem
Computers and Operations Research
Hybrid algorithms for the variable sized bin packing problem
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
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
Variable sized online interval coloring with bandwidth
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online bin packing with cardinality constraints
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Vector bin packing with multiple-choice
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Vector bin packing with multiple-choice
Discrete Applied Mathematics
The two-dimensional bin packing problem with variable bin sizes and costs
Discrete Optimization
A bin packing problem with over-sized items
Operations Research Letters
Enhancing data center sustainability through energy-adaptive computing
ACM Journal on Emerging Technologies in Computing Systems (JETC)
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
Online algorithms for single machine schedulers to support advance reservations from grid jobs
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Tight bounds for online vector bin packing
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Exploiting application dynamism and cloud elasticity for continuous dataflows
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Computers and Operations Research
| Hi-index | 0.00 |