Algorithms - ESA 2003

DOI10.1007/b13632zbMath1266.68189OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897281

Friedrich Eisenbrand, Stefan Funke, Joachim Reichel, Elmar Schömer

Publication date: 3 March 2010

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

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

Mathematics Subject Classification ID

Integer programming (90C10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

A fast heuristic for a three-dimensional non-convex domain loading problem