{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:12:29Z","timestamp":1725455549548},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635864"},{"type":"electronic","value":"9783540696056"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023911","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:20:36Z","timestamp":1132366836000},"page":"61-72","source":"Crossref","is-referenced-by-count":0,"title":["A 0\u20131 quadratic knapsack problem for modelizing and solving the constraint satisfaction problems"],"prefix":"10.1007","author":[{"given":"Mohamed","family":"Ettaouil","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591796","volume":"30","author":"E. Balas","year":"1984","unstructured":"Balas E., Mazzola J.B. (1984), \u201cNonlinear 0-1 programming linearisation techniques\u201d, Mathematical programming 30,1\u201321.","journal-title":"Mathematical programming"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F. Barahona","year":"1989","unstructured":"Barahona F., J\u00fcngler M. and Reinelt G. (1989), \u201cExperiments in quadratic 0\u20131 program-ming\u201d, Mathematical programming 44, 127\u2013137.","journal-title":"Mathematical programming"},{"key":"6_CR3","unstructured":"Bessi\u00e8re C.(1994),\u201cArc-consistency and arc-consistency again\u201d, Research note,Vol. 65"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF01586044","volume":"54","author":"A. Billionnet","year":"1992","unstructured":"Billionnet A., Sutter A. (1992), \u201cPersistency in quadratic 0\u20131 optimization\u201d, Mathematical programming 54, 115\u2013119.","journal-title":"Mathematical programming"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(84)90111-2","volume":"7","author":"M.W. Carter","year":"1984","unstructured":"Carter M.W. (1984), \u201cThe indefinite 0\u20131 Quadratic problem\u201d, Discrete Applied Mathematics, 7, 23\u201344.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"Y. Crania","year":"1989","unstructured":"Crania Y. (1989), \u201cRecognition problems for special classes of polynomials in 0\u20131 variables\u201d, Mathematical programming 44, 127\u2013137.","journal-title":"Mathematical programming"},{"key":"6_CR7","unstructured":"Ettaouil M. (1994), \u201cSatisfaction de contraintes non lin\u00e9aire en vatiables 0\u20131 et outils de la programmation quadratique\u201d, Th\u00e8se d'Universit\u00e9, Universit\u00e9 Paris 13."},{"key":"6_CR8","unstructured":"Ettaouil M., Plateau G.(1996), \u201cAn exact algorithm for the nonlinear 0\u20131 constraint Satisfaction problem\u201d, Rapport de recherche LIPN 96-10, Universit\u00e9 Paris 13."},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A. M. Geoffrion","year":"1974","unstructured":"Geoffrion A. M. (1974), \u201cThe Lagrangian relaxation for integer programming\u201d, Mathematical Programming Study 2, 82\u2013114.","journal-title":"Mathematical Programming Study"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F. Glover","year":"1974","unstructured":"Glover F., Woolsey E. (1974), \u201cConverting the 0\u20131 polynomial programming problem to 0\u20131 linear program\u201d, Operations research 22, 180\u2013182.","journal-title":"Operations research"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1002\/1520-6750(199008)37:4<527::AID-NAV3220370407>3.0.CO;2-P","volume":"37","author":"B. Kalanhari","year":"1990","unstructured":"Kalanhari B. and Bagchi A. (1990), \u201cAn algorithm for quadratic 0\u20131 programs\u201d, Naval Research Logistic, 37, 527\u2013538.","journal-title":"Naval Research Logistic"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","volume":"1","author":"S. Martello","year":"1977","unstructured":"Martello S., Toth P. (1977), \u201cAn upper bound for the 0\u20131 Knapsack problem and a branch and bound algorithm\u201d, European Journal of Operations Research 1,169\u2013175.","journal-title":"European Journal of Operations Research"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0166-218X(93)90049-T","volume":"42","author":"P. Michelon","year":"1991","unstructured":"Michelon P. et Maculan N. (1991), \u201cLagrangian methods for 0\u20131 quadratic problems\u201d, Discrete Applied Mathematics 42, 257\u2013269.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR14","unstructured":"Minoux M. (1983), \u201cProgrammation Math\u00e9matique \u201d, Tome 2 Dunod."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Mohr R. and Henderson T. C.(1986), \u201cArc and path consistency revisid\u201d Artificial Intelligence 28-2.","DOI":"10.1016\/0004-3702(86)90083-4"},{"issue":"2","key":"6_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari U. (1974), \u201cNetworks of constraints: Fundamental proprieties and applications to picture processing\u201d, Information Sciences, Vol. 7 N\u00b02, 95\u2013132.","journal-title":"Information Sciences"},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos P.M., Rogers G.P. (1990), \u201cComputational Aspects of a Branch and Bound algorithm for quadratic 0\u20131 programming\u201d, Computing, 45, 131\u2013144.","journal-title":"Computing"},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"L.J. Watters","year":"1967","unstructured":"Watters L.J. (1967), \u201cReduction of integer polynomial programming problems to zero-one linear programming problems\u201d, Operations Research 15, 1171\u20131174.","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023911","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:34:51Z","timestamp":1586554491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635864","9783540696056"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0023911","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}