{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:03:48Z","timestamp":1725483828995},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_46","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T05:59:47Z","timestamp":1179208787000},"page":"686-691","source":"Crossref","is-referenced-by-count":7,"title":["A Relaxation of the Cumulative Constraint"],"prefix":"10.1007","author":[{"given":"John N.","family":"Hooker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun, A., and N. Beldiceanu, Extending CHIP in order to solve complex scheduling and placement problems, Mathematical and Computer Modelling\n                  17 (1993) 57\u201373.","journal-title":"Mathematical and Computer Modelling"},{"key":"46_CR2","first-page":"375","volume-title":"Principles and Practice of Constraint Programming (CP 97)","author":"P. Baptiste","year":"1997","unstructured":"Baptiste, P., and C. Le Pape, Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Principles and Practice of Constraint Programming (CP 97), Springer-Verlag (Berlin, 1997) 375\u201389."},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","volume":"10","author":"A. Bockmayr","year":"1998","unstructured":"Bockmayr, A., and T. Kasper. 1998. Branch and infer: A unifying framework for integer and finite domain constraint programming, INFORMS Journal on Computing\n                  10 287\u2013300.","journal-title":"INFORMS Journal on Computing"},{"key":"46_CR4","unstructured":"Demassey, S., C. Artigues and P. Michelon, A hybrid constraint propagation-cutting plane algorithm for the RCPSP, 4th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR\u201902), Le Croisic, France (2002) 321\u2013331."},{"key":"46_CR5","unstructured":"Heipcke, S. 1999. Combined Modelling and Problem Solving in Mathematical Programming and Constraint Programming, Ph.D. Thesis, University of Buckingham."},{"key":"46_CR6","unstructured":"Hooker, J. N. 1995. Logic-based Benders decomposition, presented at INFORMS 1995."},{"key":"46_CR7","first-page":"1","volume-title":"Advances in Computational and Stochasic Optimization, Logic Programming and Heuristic Search","author":"J. N. Hooker","year":"1997","unstructured":"Hooker, J. N. 1997. Constraint satisfaction methods for generating valid cuts, in D. L. Woodruff, ed., Advances in Computational and Stochasic Optimization, Logic Programming and Heuristic Search, Kluwer (Dordrecht) 1\u201330."},{"key":"46_CR8","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. 2000. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction, Wiley (New York)."},{"key":"46_CR9","unstructured":"Hooker, J. N. 2001. Logic, optimization and constraint programming, to appear in INFORMS Journal on Computing."},{"key":"46_CR10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"96-97","author":"J. N. Hooker","year":"1999","unstructured":"Hooker, J. N., and M. A. Osorio. 1999. Mixed logical\/linear programming, Discrete Applied Mathematics\n                  96-97 395\u2013442.","journal-title":"Discrete Applied Mathematics"},{"key":"46_CR11","unstructured":"Hooker, J. N., and G. Ottosson, Logic-based Benders decomposition, to appear in Mathematical Programming."},{"key":"46_CR12","unstructured":"Jain, V., and I. E. Grossmann. 1999. Algorithms for hybrid MILP\/CLP models for a class of optimization problems, INFORMS Journal on Computing, to appear."},{"key":"46_CR13","unstructured":"Ottosson, G., and E. Thorsteinsson. 2000. Linear relaxations and reduced-cost based propagation of continuous variable subscripts, CP\u2019AI\u2019OR\u201900."},{"key":"46_CR14","unstructured":"Ottosson, G., E. Thorsteinsson, and J. N. Hooker. 1999. Mixed global constraints and inference in hybrid CLP-IP solvers, CP99 Post-Conference Workshop on Large Scale Combinatorial Optimization and Constraints, \n                    http:\/\/www.dash.co.uk\/wscp99\n                    \n                  , 57\u201378."},{"key":"46_CR15","series-title":"Lect Notes Comput Sci","first-page":"373","volume-title":"Principles and Practice of Constraint Programming","author":"P. R\u00e9falo","year":"1999","unstructured":"R\u00e9falo, P. 1999. Tight cooperation and its application in piecewise linear optimization, in J. Jaffar, ed., Principles and Practice of Constraint Programming, Lecture Notes in Computer Science 1713, Springer (Berlin), 373\u2013389."},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Thorsteinsson, E. S. 2001. Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming, CP01.","DOI":"10.1007\/3-540-45578-7_2"},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1287\/ijoc.10.3.261","volume":"10","author":"H. P. Williams","year":"1998","unstructured":"Williams, H. P., and J. M. Wilson. 1998. Connections between integer linear programming and constraint logic programming-An overview and introduction to the cluster of articles, INFORMS Journal on Computing\n                  10 261\u2013264.","journal-title":"INFORMS Journal on Computing"},{"key":"46_CR18","unstructured":"Williams, H. P., and Hong Yan. 2001. Representations of the all-different predicate, INFORMS Journal on Computing, to appear."},{"key":"46_CR19","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s101070050061","volume":"85","author":"H. Yan","year":"1999","unstructured":"Yan, H., and J. N. Hooker. 1999. Tight representation of logical constraints as cardinality rules, Mathematical Programming\n                  85 363\u2013377.","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,23]],"date-time":"2019-01-23T18:52:37Z","timestamp":1548269557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}