<--- Back to Details
First PageDocument Content
Packaging / Packing problem / Quadrilaterals / Rectangle / Bin / Algorithm / Area / Proportionality / Largest empty rectangle / Mathematics / Geometry / Discrete geometry
Date: 2006-01-11 07:52:01
Packaging
Packing problem
Quadrilaterals
Rectangle
Bin
Algorithm
Area
Proportionality
Largest empty rectangle
Mathematics
Geometry
Discrete geometry

Optimal Rectangle Packing: Initial Results

Add to Reading List

Source URL: www.aaai.org

Download Document from Source Website

File Size: 506,19 KB

Share Document on Facebook

Similar Documents

393 Documenta Math. On Packing Spheres into Containers About Kepler’s Finite Sphere Packing Problem

DocID: 1sL2Z - View Document

An Ant Colony Optimisation Algorithm for the Set Packing Problem Xavier GANDIBLEUX1,2 , Xavier DELORME2 and Vincent T’KINDT3 (1) LINA - Laboratoire d’Informatique de Nantes Atlantique Universite de Nantes 2 rue de la

DocID: 1sGNm - View Document

The sphere packing problem in dimension 8 Maryna S. Viazovska arXiv:1603.04246v1 [math.NT] 14 Mar 2016

DocID: 1sa5K - View Document

MIC2005: The Sixth Metaheuristics International Conference ??-1 An ant colony optimization inspired algorithm for the Set Packing Problem with application to railway infrastructure

DocID: 1rBph - View Document

International Journal on Computational Science & Applications (IJCSA) Vol.5,No.6, DecemberBIN PACKING PROBLEM: A LINEAR CONSTANT SPACE -APPROXIMATION ALGORITHM 

DocID: 1rwBs - View Document