{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:22:32Z","timestamp":1742991752096,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232188"},{"type":"electronic","value":"9783319232195"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_12","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"158-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["General Bounding Mechanism for Constraint Programs"],"prefix":"10.1007","author":[{"given":"Minh Ho\u00e0ng","family":"H\u00e0","sequence":"first","affiliation":[]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[]},{"given":"Louis-Martin","family":"Rousseau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"key":"12_CR1","unstructured":"Beasley, J.E.: OR-library (2012). http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html"},{"key":"12_CR2","unstructured":"Benoist, T., Laburthe, F., Rottembourg, B.: Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems. In: CP-AI-OR 2001, pp. 15\u201326. Wye College (2001)"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.ejor.2014.05.033","volume":"239","author":"N Chapados","year":"2014","unstructured":"Chapados, N., Joliveau, M., L\u2019Ecuyer, P., Rousseau, L.-M.: Retail store scheduling for profit. European Journal of Operational Research 239(3), 609\u2013624 (2014). doi:10.1016\/j.ejor.2014.05.033","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/s10601-009-9083-2","volume":"16","author":"M-C C\u00f4t\u00e9","year":"2011","unstructured":"C\u00f4t\u00e9, M.-C., Gendron, B., Quimper, C.-G., Rousseau, L.-M.: Formal languages for integer programming modeling of shift scheduling problems. Constraints 16(1), 54\u201376 (2011). doi:10.1007\/s10601-009-9083-2","journal-title":"Constraints"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/978-3-540-30201-8_55","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"W Cronholm","year":"2004","unstructured":"Cronholm, W., Ajili, F.: Strong cost-based filtering for lagrange decomposition applied to network design. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 726\u2013730. Springer, Heidelberg (2004). http:\/\/www.springerlink.com\/index\/ur3uvyqbp0216btd.pdf"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10601-006-9003-7","volume":"11","author":"S Demassey","year":"2006","unstructured":"Demassey, S., Pesant, G., Rousseau, L.-M.: A cost-regular based hybrid column generation approach. Constraints 11(4), 315\u2013333 (2006). http:\/\/dblp.uni-trier.de\/db\/journals\/constraints\/constraints11.html#DemasseyPR06","journal-title":"Constraints"},{"issue":"1\u20134","key":"12_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1021193019522","volume":"115","author":"T Fahle","year":"2002","unstructured":"Fahle, T., Sellmann, M.: Cost based filtering for the constrained knapsack problem. Annals of OR 115(1\u20134), 73\u201393 (2002). doi:10.1023\/A:1021193019522","journal-title":"Annals of OR"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-319-10428-7_25","volume-title":"Principles and Practice of Constraint Programming","author":"D Fontaine","year":"2014","unstructured":"Fontaine, D., Michel, L.D., Van Hentenryck, P.: Constraint-based lagrangian relaxation. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 324\u2013339. Springer, Heidelberg (2014)"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02579036","volume":"11","author":"M Guignard","year":"2003","unstructured":"Guignard, M.: Lagrangean relaxation. Top 11(2), 151\u2013200 (2003). doi:10.1007\/BF02579036. ISSN: 1134\u20135764","journal-title":"Lagrangean relaxation. Top"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M Guignard","year":"1987","unstructured":"Guignard, M., Kim, S.: Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Mathematical Programming 39(2), 215\u2013228 (1987). doi:10.1007\/BF02592954. ISSN: 00255610","journal-title":"Mathematical Programming"},{"key":"12_CR11","unstructured":"Katriel, I., Sellmann, M., Upfal, E., Van Hentenryck, P.: Propagating knapsack constraints in sublinear time. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, Vancouver, British Columbia, Canada, July 22\u201326, pp. 231\u2013236 (2007). http:\/\/www.aaai.org\/Library\/AAAI\/2007\/aaai07-035.php"},{"key":"12_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"12_CR13","unstructured":"Malitsky, Y., Sellmann, M., Szymanek, R.: Filtering bounded knapsack constraints in expected sublinear time. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11\u201315, 2010. http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI10\/paper\/view\/1855"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-01929-6_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J Menana","year":"2009","unstructured":"Menana, J., Demassey, S.: Sequencing and counting with the multicost-regular constraint. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 178\u2013192. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-01929-6_14. ISBN: 3642019285"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.10110","volume":"43","author":"W Ouaja","year":"2004","unstructured":"Ouaja, W., Richards, B.: A hybrid multicommodity routing algorithm for traffic engineering. Networks 43(3), 125\u2013140 (2004). http:\/\/dblp.uni-trier.de\/db\/journals\/networks\/networks43.html#OuajaR04","journal-title":"Networks"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-30201-8_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"G Pesant","year":"2004","unstructured":"Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482\u2013495. Springer, Heidelberg (2004). http:\/\/www.springerlink.com\/content\/ed24kyhg561jjthj"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10732-009-9106-6","volume":"16","author":"C-G Quimper","year":"2010","unstructured":"Quimper, C.-G., Rousseau, L.-M.: A large neighbourhood search approach to the multi-activity shift scheduling problem. J. Heuristics 16(3), 373\u2013392 (2010). doi:10.1007\/s10732-009-9106-6","journal-title":"J. Heuristics"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-540-45193-8_46","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M Sellmann","year":"2003","unstructured":"Sellmann, M.: Approximated consistency for knapsack constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 679\u2013693. Springer, Heidelberg (2003). doi:10.1007\/978-3-540-45193-8_46"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-30201-8_46","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"M Sellmann","year":"2004","unstructured":"Sellmann, M.: Theoretical foundations of CP-based lagrangian relaxation. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 634\u2013647. Springer, Heidelberg (2004). http:\/\/dblp.uni-trier.de\/db\/conf\/cp\/cp\/2004.html#sellmann. ISBN: 3-540-23241-9"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1021845304798","volume":"118","author":"M Sellmann","year":"2003","unstructured":"Sellmann, M., Fahle, T.: Constraint programming based Lagrangian relaxation for the automatic recording problem. Annals of Operations Research 118, 17\u201333 (2003). doi:10.1023\/A:1021845304798. ISBN: 0254-5330","journal-title":"Annals of Operations Research"},{"key":"12_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization methods for non-differentiable functions","author":"NZ Shor","year":"1985","unstructured":"Shor, N.Z., Kiwiel, K.C., Ruszcay\u0144ski, A., Ruszcay\u0144ski, A.: Minimization methods for non-differentiable functions. Springer-Verlag New York Inc., New York (1985). ISBN: 0-387-12763-1"},{"issue":"1\u20134","key":"12_CR22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1021801522545","volume":"118","author":"MA Trick","year":"2003","unstructured":"Trick, M.A.: A dynamic programming approach for consistency and propagation for knapsack constraints. Annals of OR 118(1\u20134), 73\u201384 (2003). http:\/\/dblp.uni-trier.de\/db\/journals\/anor\/anor118.html#Trick03","journal-title":"Annals of OR"},{"issue":"4\u20135","key":"12_CR23","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10732-006-6550-4","volume":"12","author":"WJ van Hoeve","year":"2006","unstructured":"van Hoeve, W.J., Pesant, G., Rousseau, L.-M.: On global warming: Flow-based soft global constraints. J. Heuristics 12(4\u20135), 347\u2013373 (2006). doi:10.1007\/s10732-006-6550-4","journal-title":"J. Heuristics"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T14:26:56Z","timestamp":1675866416000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}