Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68431OpenAlexW2495578842MaRDI QIDQ5431327

Leah Epstein

Publication date: 7 December 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11836

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Approximation and online algorithms for multidimensional bin packing: a survey ⋮ On-line scheduling mesh jobs with dependencies ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ Two-dimensional online bin packing with rotation ⋮ Three-dimensional packings with rotations ⋮ Unnamed Item

This page was built for publication: Mathematical Foundations of Computer Science 2003