@article{fekete_new_2001,
	title = {New classes of fast lower bounds for bin packing problems},
	volume = {91},
	url = {http://dx.doi.org/10.1007/s101070100243},
	doi = {10.1007/s101070100243},
	abstract = {Abstract.   The bin packing problem is one of the classical NP-hard optimization problems. In this paper, we present a simple generic
approach for obtaining new fast lower bounds, based on dual feasible functions. Worst-case analysis as well as computational
results show that one of our classes clearly outperforms the previous best “economical” lower bound for the bin packing problem
by Martello and Toth, which can be understood as a special case. In particular, we prove an asymptotic worst-case performance
of 3/4 for a bound that can be computed in linear time for items sorted by size. In addition, our approach provides a general
framework for establishing new bounds.},
	number = {1},
	urldate = {2010-04-02TZ},
	journal = {Mathematical Programming},
	author = {Fekete, Sándor P. and Schepers, Jörg},
	month = oct,
	year = {2001},
	pages = {11--31}
}

{"_id":"qhaPL7SjZn4JrXBwj","bibbaseid":"fekete-schepers-newclassesoffastlowerboundsforbinpackingproblems-2001","downloads":0,"creationDate":"2016-12-19T20:50:58.779Z","title":"New classes of fast lower bounds for bin packing problems","author_short":["Fekete, S. P.","Schepers, J."],"year":2001,"bibtype":"article","biburl":"http://bibbase.org/zotero/verschae","bibdata":{"bibtype":"article","type":"article","title":"New classes of fast lower bounds for bin packing problems","volume":"91","url":"http://dx.doi.org/10.1007/s101070100243","doi":"10.1007/s101070100243","abstract":"Abstract. The bin packing problem is one of the classical NP-hard optimization problems. In this paper, we present a simple generic approach for obtaining new fast lower bounds, based on dual feasible functions. Worst-case analysis as well as computational results show that one of our classes clearly outperforms the previous best “economical” lower bound for the bin packing problem by Martello and Toth, which can be understood as a special case. In particular, we prove an asymptotic worst-case performance of 3/4 for a bound that can be computed in linear time for items sorted by size. In addition, our approach provides a general framework for establishing new bounds.","number":"1","urldate":"2010-04-02TZ","journal":"Mathematical Programming","author":[{"propositions":[],"lastnames":["Fekete"],"firstnames":["Sándor","P."],"suffixes":[]},{"propositions":[],"lastnames":["Schepers"],"firstnames":["Jörg"],"suffixes":[]}],"month":"October","year":"2001","pages":"11--31","bibtex":"@article{fekete_new_2001,\n\ttitle = {New classes of fast lower bounds for bin packing problems},\n\tvolume = {91},\n\turl = {http://dx.doi.org/10.1007/s101070100243},\n\tdoi = {10.1007/s101070100243},\n\tabstract = {Abstract. The bin packing problem is one of the classical NP-hard optimization problems. In this paper, we present a simple generic\napproach for obtaining new fast lower bounds, based on dual feasible functions. Worst-case analysis as well as computational\nresults show that one of our classes clearly outperforms the previous best “economical” lower bound for the bin packing problem\nby Martello and Toth, which can be understood as a special case. In particular, we prove an asymptotic worst-case performance\nof 3/4 for a bound that can be computed in linear time for items sorted by size. In addition, our approach provides a general\nframework for establishing new bounds.},\n\tnumber = {1},\n\turldate = {2010-04-02TZ},\n\tjournal = {Mathematical Programming},\n\tauthor = {Fekete, Sándor P. and Schepers, Jörg},\n\tmonth = oct,\n\tyear = {2001},\n\tpages = {11--31}\n}\n\n","author_short":["Fekete, S. P.","Schepers, J."],"key":"fekete_new_2001","id":"fekete_new_2001","bibbaseid":"fekete-schepers-newclassesoffastlowerboundsforbinpackingproblems-2001","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s101070100243"},"downloads":0,"html":""},"search_terms":["new","classes","fast","lower","bounds","bin","packing","problems","fekete","schepers"],"keywords":[],"authorIDs":[],"dataSources":["TJDe75XCoX4GYYsBX"]}