scientific article
From MaRDI portal
Publication:2909025
zbMath1245.68245MaRDI QIDQ2909025
Gábor Galambos, József Békési, János Balogh, Gerhard Reinelt
Publication date: 29 August 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Semi-on-line bin packing: a short overview and a new lower bound ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
This page was built for publication:
