Almost optimal solutions for bin coloring problems

DOI10.1007/s10878-007-9094-0zbMath1152.90579OpenAlexW2045985674MaRDI QIDQ941831

Mingen Lin, Zhiyong Lin, Jinhui Xu

Publication date: 2 September 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9094-0

zbMATH Keywords

Approximation algorithmsBin packingOnline algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Selfish bin coloring

Cites Work

• On two class-constrained versions of the multiple knapsack problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Almost optimal solutions for bin coloring problems