Le problème de bin-packing en deux-dimensions, le cas non-orienté : résolution approchée et bornes inférieures. (The two-dimensional bin-packing problem, the non-oriented case: resolution algorithms and lower bounds).
J. Hayek. University of Technology of Compiègne, France, (2006)
%0 Thesis
%1 phd/hal/ElHayek06
%A Hayek, Joseph El
%D 2006
%K dblp
%T Le problème de bin-packing en deux-dimensions, le cas non-orienté : résolution approchée et bornes inférieures. (The two-dimensional bin-packing problem, the non-oriented case: resolution algorithms and lower bounds).
@phdthesis{phd/hal/ElHayek06,
added-at = {2020-07-21T00:00:00.000+0200},
author = {Hayek, Joseph El},
biburl = {https://www.bibsonomy.org/bibtex/29da91b2a2be5c851ad2c712eb746d400/dblp},
ee = {https://tel.archives-ouvertes.fr/tel-00158728},
interhash = {6b82b61bbdb57817550e75a7d7f13a85},
intrahash = {9da91b2a2be5c851ad2c712eb746d400},
keywords = {dblp},
school = {University of Technology of Compiègne, France},
timestamp = {2020-07-24T00:49:20.000+0200},
title = {Le problème de bin-packing en deux-dimensions, le cas non-orienté : résolution approchée et bornes inférieures. (The two-dimensional bin-packing problem, the non-oriented case: resolution algorithms and lower bounds).},
year = 2006
}
