{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:10:05Z","timestamp":1770286205857,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540343066","type":"print"},{"value":"9783540343073","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11757375_3","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T07:59:15Z","timestamp":1148025555000},"page":"3-15","source":"Crossref","is-referenced-by-count":2,"title":["Duality in Optimization and Constraint Satisfaction"],"prefix":"10.1007","author":[{"given":"J. N.","family":"Hooker","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona, F., Anbil, R.: The volume algorithm: Producing primal solutions with a subgradient algorithm. Mathematical Programming\u00a087, 385\u2013399 (2000)","journal-title":"Mathematical Programming"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik\u00a04, 238\u2013252 (1962)","journal-title":"Numerische Mathematik"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01583794","volume":"23","author":"C.E. Blair","year":"1982","unstructured":"Blair, C.E., Jeroslow, R.G.: The value function of a mixed integer program. Mathematical Programming\u00a023, 237\u2013273 (1982)","journal-title":"Mathematical Programming"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics\u00a04, 305\u2013337 (1973)","journal-title":"Discrete Mathematics"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01582230","volume":"34","author":"W. Cook","year":"1986","unstructured":"Cook, W., Gerards, A.M.H., Schrijver, A., Tardos, E.: Sensitivity results in integer programming. Mathematical Programming\u00a034, 251\u2013264 (1986)","journal-title":"Mathematical Programming"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1287\/opre.48.4.623.12420","volume":"48","author":"M. Dawande","year":"2000","unstructured":"Dawande, M., Hooker, J.N.: Inference-based sensitivity analysis for mixed integer\/linear programming. Operations Research\u00a048, 623\u2013634 (2000)","journal-title":"Operations Research"},{"key":"3_CR7","unstructured":"Dechter, R.: Mini-buckets: A general scheme of generating approximations in automated reasoning. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 1297\u20131302 (1997)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/636865.636866","volume":"50","author":"R. Dechter","year":"2003","unstructured":"Dechter, R., Rish, I.: Mini-buckets: A general scheme for bounded inference. Journal of the ACM\u00a050, 107\u2013153 (2003)","journal-title":"Journal of the ACM"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A.M. Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized benders decomposition. Journal of Optimization Theory and Applications\u00a010, 237\u2013260 (1972)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1287\/opre.23.3.434","volume":"23","author":"F. Glover","year":"1975","unstructured":"Glover, F.: Surrogate constraint duality in mathematical programming. Operations Research\u00a023, 434\u2013451 (1975)","journal-title":"Operations Research"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1023\/A:1009838725226","volume":"4","author":"J.N. Hooker","year":"1999","unstructured":"Hooker, J.N.: Inference duality as a basis for sensitivity analysis. Constraints\u00a04, 104\u2013112 (1999)","journal-title":"Constraints"},{"key":"3_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033036","volume-title":"Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction","author":"J.N. Hooker","year":"2000","unstructured":"Hooker, J.N.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York (2000)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10601-005-2812-2","volume":"10","author":"J.N. Hooker","year":"2005","unstructured":"Hooker, J.N.: A hybrid method for planning and scheduling. Constraints\u00a010, 385\u2013401 (2005)","journal-title":"Constraints"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J.N. Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Mathematical Programming\u00a096, 33\u201360 (2003)","journal-title":"Mathematical Programming"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"Jain, V., Grossmann, I.E.: Algorithms for hybrid MILP\/CP models for a class of optimization problems. INFORMS Journal on Computing\u00a013, 258\u2013276 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0012-365X(78)90112-7","volume":"23","author":"R.G. Jeroslow","year":"1978","unstructured":"Jeroslow, R.G.: Cutting plane theory: Algebraic methods. Discrete Mathematics\u00a023, 121\u2013150 (1978)","journal-title":"Discrete Mathematics"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/B978-0-12-358350-5.50009-9","volume-title":"Mathematical Programming","author":"E.L. Johnson","year":"1973","unstructured":"Johnson, E.L.: Cyclic groups, cutting planes and shortest paths. In: Hu, T.C., Robinson, S. (eds.) Mathematical Programming, pp. 185\u2013211. Academic Press, London (1973)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001), pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"A. Nedic","year":"2001","unstructured":"Nedic, A., Bertsekas, D.P.: Incremental subgradient methods for nondifferentiable optimization. SIAM Journal on Optimization\u00a012, 109\u2013138 (2001)","journal-title":"SIAM Journal on Optimization"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(81)90016-0","volume":"3","author":"L.A. Wolsey","year":"1981","unstructured":"Wolsey, L.A.: The b-hull of an integer program. Discrete Applied Mathematics\u00a03, 193\u2013201 (1981)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11757375_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:13Z","timestamp":1619507053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11757375_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343066","9783540343073"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11757375_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}