A new upper bound for the online square packing problem in a strip

From MaRDI portal
Publication:2012894

DOI10.1007/S10878-016-0046-4zbMATH Open1376.90055OpenAlexW2475025173MaRDI QIDQ2012894FDOQ2012894


Authors: Guosong Yu, Yanling Mao, Jiaoliao Xiao Edit this on Wikidata


Publication date: 3 August 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0046-4




Recommendations




Cites Work


Cited In (7)





This page was built for publication: A new upper bound for the online square packing problem in a strip

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012894)