Publication:2741495
From MaRDI portal
zbMath0984.90058MaRDI QIDQ2741495
Jay Sethuraman, Milind W. Dawande, Jayant R. Kalagnanam
Publication date: 24 October 2001
approximation algorithms; asymptotic polynomial time approximation scheme; variable sized bin packing problem with color constraints
90C59: Approximation methods and heuristics in mathematical programming
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05B40: Combinatorial aspects of packing and covering
Related Items
Relaxations and exact solution of the variable sized bin packing problem, VNS matheuristic for a bin packing problem with a color constraint, The class constrained bin packing problem with applications to video-on-demand, A note on dual approximation algorithms for class constrained bin packing problems
Cites Work