{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:18:57Z","timestamp":1740122337531,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,10,14]],"date-time":"2017-10-14T00:00:00Z","timestamp":1507939200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10601-017-9278-x","type":"journal-article","created":{"date-parts":[[2017,10,14]],"date-time":"2017-10-14T04:51:11Z","timestamp":1507956671000},"page":"251-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved filtering for the bin-packing with cardinality constraint"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6700-3519","authenticated-orcid":false,"given":"Guillaume","family":"Derval","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Charles","family":"R\u00e9gin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"key":"9278_CR1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S1574-6526(06)80007-6","volume":"2","author":"C Bessiere","year":"2006","unstructured":"Bessiere, C. (2006). Constraint propagation. Foundations of Artificial Intelligence, 2, 29\u201383.","journal-title":"Foundations of Artificial Intelligence"},{"key":"9278_CR2","doi-asserted-by":"crossref","unstructured":"Cambazard, H., & O\u2019Sullivan, B. (2010). Propagating the bin packing constraint using linear programming. In Cohen, D. (Ed.) International Conference on Principles and Practice of Constraint Programming (pp. 129\u2013136). Berlin: Springer.","DOI":"10.1007\/978-3-642-15396-9_13"},{"key":"9278_CR3","doi-asserted-by":"crossref","unstructured":"Dupuis, J., Schaus, P., & Deville, Y. (2010). Consistency check for the bin packing constraint revisited. In International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, pp. 117\u2013122. Springer.","DOI":"10.1007\/978-3-642-13520-0_15"},{"issue":"2","key":"9278_CR4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., & Karp, R.M. (1972). Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM (JACM), 19(2), 248\u2013264.","journal-title":"Journal of the ACM (JACM)"},{"key":"9278_CR5","volume-title":"A simple algorithm for finding maximal network flows and an application to the Hitchcock problem","author":"LR Ford","year":"1955","unstructured":"Ford, L.R., & Fulkerson, D.R. (1955). A simple algorithm for finding maximal network flows and an application to the Hitchcock problem. DTIC Document: Tech. rep."},{"issue":"4","key":"9278_CR6","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"AV Goldberg","year":"1989","unstructured":"Goldberg, A.V., & Tarjan, R.E. (1989). Finding minimum-cost circulations by canceling negative cycles. J. ACM, 36(4), 873\u2013886.","journal-title":"J. ACM"},{"issue":"1","key":"9278_CR7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-6377(94)00060-J","volume":"17","author":"M Labb\u00e9","year":"1995","unstructured":"Labb\u00e9, M., Laporte, G., & Martello, S. (1995). An exact algorithm for the dual bin packing problem. Operations Research Letters, 17(1), 9\u201318. http:\/\/www.sciencedirect.com\/science\/article\/pii\/016763779400060J .","journal-title":"Operations Research Letters"},{"issue":"3","key":"9278_CR8","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/S0377-2217(02)00466-6","volume":"149","author":"M Labb\u00e9","year":"2003","unstructured":"Labb\u00e9, M., Laporte, G., & Martello, S. (2003). Upper bounds and algorithms for the maximum cardinality bin packing problem. European Journal of Operational Research, 149(3), 490\u2013498. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221702004666 .","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"9278_CR9","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","volume":"123","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., & Vigo, D. (2002). Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics, 123(1), 379\u2013396. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X0100347X .","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"9278_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics, 28(1), 59\u201370. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0166218X9090094S .","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"9278_CR11","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello, S., & Vigo, D. (1998). Exact solution of the two-dimensional finite bin packing problem. Management science, 44(3), 388\u2013399.","journal-title":"Management science"},{"key":"9278_CR12","unstructured":"Mohr, R., & Masini, G. (1988). Good Old Discrete Relaxation. In Kodratoff, Y. (Ed.) 8th European Conference on Artificial Intelligence (ECAI \u201988)(pp. 651\u2013656). Munich: Pitmann Publishing. https:\/\/hal.inria.fr\/inria-00548479 ."},{"key":"9278_CR13","unstructured":"Monette, J.-N., Schaus, P., Zampelli, S., Deville, Y., & Dupont, P. (2007). A CP approach to the balanced academic curriculum problem. In Seventh International Workshop on Symmetry and Constraint Satisfaction Problems, vol. 7."},{"key":"9278_CR14","unstructured":"OscaR Team. OscaR: Scala in OR (2012). Available from https:\/\/bitbucket.org\/oscarlib\/oscar ."},{"key":"9278_CR15","doi-asserted-by":"crossref","unstructured":"Pelsser, F., Schaus, P., & R\u00e9gin, J.-C. (2013). Revisiting the cardinality reasoning for binpacking constraint. In International Conference on Principles and Practice of Constraint Programming, pp. 578\u2013586. Springer.","DOI":"10.1007\/978-3-642-40627-0_43"},{"key":"9278_CR16","unstructured":"R\u0117gin, J., & Rezgui, M. (2011). Discussion about constraint programming bin packing models. In AI for Data Center Management and Cloud Computing, Papers from the 2011 AAAI Workshop, San Francisco, California, USA, August 7, 2011. http:\/\/www.aaai.org\/ocs\/index.php\/WS\/AAAIW11\/paper\/view\/3817 ."},{"key":"9278_CR17","unstructured":"R\u00e9gin, J.-C. (1996). Generalized arc consistency for global cardinality constraint. In Proceedings of the thirteenth national conference on Artificial intelligence-Volume 1, pp. 209\u2013215. AAAI Press."},{"key":"9278_CR18","volume-title":"Solving balancing and bin-packing problems with constraint programming","author":"P Schaus","year":"2009","unstructured":"Schaus, P. (2009). Solving balancing and bin-packing problems with constraint programming. These de doctorat: Universit\u00e9 catholique de Louvain."},{"key":"9278_CR19","doi-asserted-by":"crossref","unstructured":"Schaus, P., R\u00e9gin, J.-C., Schaeren, R.V., Dullaert, W., & Raa, B. (2012). Cardinality reasoning for bin-packing constraint. application to a tank allocation problem. In International Conference on Principles and Practice of Constraint Programming.","DOI":"10.1007\/978-3-642-33558-7_58"},{"key":"9278_CR20","doi-asserted-by":"crossref","unstructured":"Schaus, P., R\u00e9gin, J.-C., Van Schaeren, R., Dullaert, W., & Raa, B. (2012). Cardinality reasoning for bin-packing constraint: application to a tank allocation problem. In International Conference on Principles and Practice of Constraint Programming, pp. 815\u2013822. Springer.","DOI":"10.1007\/978-3-642-33558-7_58"},{"key":"9278_CR21","doi-asserted-by":"crossref","unstructured":"Shaw, P. (2004). A constraint for bin packing. In International Conference on Principles and Practice of Constraint Programming, pp. 648\u2013662. Springer.","DOI":"10.1007\/978-3-540-30201-8_47"},{"key":"9278_CR22","doi-asserted-by":"crossref","unstructured":"Van Cauwelaert, S., Lombardi, M., & Schaus, P. (2017). How efficient is a global constraint in practice Constraints.","DOI":"10.1007\/s10601-017-9277-y"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-017-9278-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9278-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9278-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T13:48:53Z","timestamp":1570196933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-017-9278-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,14]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["9278"],"URL":"https:\/\/doi.org\/10.1007\/s10601-017-9278-x","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2017,10,14]]}}}