@article{crainic_new_2007,
	title = {New bin packing fast lower bounds},
	volume = {34},
	url = {http://portal.acm.org/citation.cfm?id=1236144},
	abstract = {In this paper, we address the issue of computing fast lower bounds for the Bin Packing problem, i.e., bounds that have a computational complexity dominated by the complexity of ordering the items by non-increasing values of their volume. We introduce new classes of fast lower bounds with improved asymptotic worst-case performance compared to well-known results for similar computational effort. Experimental results on a large set of problem instances indicate that the proposed bounds reduce both the deviation from the optimum and the computational effort.},
	number = {11},
	urldate = {2010-04-02TZ},
	journal = {Comput. Oper. Res.},
	author = {Crainic, Teodor Gabriel and Perboli, Guido and Pezzuto, Miriam and Tadei, Roberto},
	year = {2007},
	keywords = {Bin packing, lower bounds},
	pages = {3439--3457}
}

{"_id":"eeEEeYZrjfy9tqLT9","bibbaseid":"crainic-perboli-pezzuto-tadei-newbinpackingfastlowerbounds-2007","downloads":0,"creationDate":"2016-12-19T20:50:58.784Z","title":"New bin packing fast lower bounds","author_short":["Crainic, T. G.","Perboli, G.","Pezzuto, M.","Tadei, R."],"year":2007,"bibtype":"article","biburl":"http://bibbase.org/zotero/verschae","bibdata":{"bibtype":"article","type":"article","title":"New bin packing fast lower bounds","volume":"34","url":"http://portal.acm.org/citation.cfm?id=1236144","abstract":"In this paper, we address the issue of computing fast lower bounds for the Bin Packing problem, i.e., bounds that have a computational complexity dominated by the complexity of ordering the items by non-increasing values of their volume. We introduce new classes of fast lower bounds with improved asymptotic worst-case performance compared to well-known results for similar computational effort. Experimental results on a large set of problem instances indicate that the proposed bounds reduce both the deviation from the optimum and the computational effort.","number":"11","urldate":"2010-04-02TZ","journal":"Comput. Oper. Res.","author":[{"propositions":[],"lastnames":["Crainic"],"firstnames":["Teodor","Gabriel"],"suffixes":[]},{"propositions":[],"lastnames":["Perboli"],"firstnames":["Guido"],"suffixes":[]},{"propositions":[],"lastnames":["Pezzuto"],"firstnames":["Miriam"],"suffixes":[]},{"propositions":[],"lastnames":["Tadei"],"firstnames":["Roberto"],"suffixes":[]}],"year":"2007","keywords":"Bin packing, lower bounds","pages":"3439--3457","bibtex":"@article{crainic_new_2007,\n\ttitle = {New bin packing fast lower bounds},\n\tvolume = {34},\n\turl = {http://portal.acm.org/citation.cfm?id=1236144},\n\tabstract = {In this paper, we address the issue of computing fast lower bounds for the Bin Packing problem, i.e., bounds that have a computational complexity dominated by the complexity of ordering the items by non-increasing values of their volume. We introduce new classes of fast lower bounds with improved asymptotic worst-case performance compared to well-known results for similar computational effort. Experimental results on a large set of problem instances indicate that the proposed bounds reduce both the deviation from the optimum and the computational effort.},\n\tnumber = {11},\n\turldate = {2010-04-02TZ},\n\tjournal = {Comput. Oper. Res.},\n\tauthor = {Crainic, Teodor Gabriel and Perboli, Guido and Pezzuto, Miriam and Tadei, Roberto},\n\tyear = {2007},\n\tkeywords = {Bin packing, lower bounds},\n\tpages = {3439--3457}\n}\n\n","author_short":["Crainic, T. G.","Perboli, G.","Pezzuto, M.","Tadei, R."],"key":"crainic_new_2007","id":"crainic_new_2007","bibbaseid":"crainic-perboli-pezzuto-tadei-newbinpackingfastlowerbounds-2007","role":"author","urls":{"Paper":"http://portal.acm.org/citation.cfm?id=1236144"},"keyword":["Bin packing","lower bounds"],"downloads":0,"html":""},"search_terms":["new","bin","packing","fast","lower","bounds","crainic","perboli","pezzuto","tadei"],"keywords":["bin packing","lower bounds"],"authorIDs":[],"dataSources":["TJDe75XCoX4GYYsBX"]}