scientific article
From MaRDI portal
Publication:2741495
zbMath0984.90058MaRDI QIDQ2741495
Jay Sethuraman, Milind W. Dawande, Jayant R. Kalagnanam
Publication date: 24 October 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximation algorithmsasymptotic polynomial time approximation schemevariable sized bin packing problem with color constraints
Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of packing and covering (05B40)
Related Items (6)
Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ VNS matheuristic for a bin packing problem with a color constraint ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ The class constrained bin packing problem with applications to video-on-demand ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ A note on dual approximation algorithms for class constrained bin packing problems
Cites Work
This page was built for publication:
