{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T11:55:16Z","timestamp":1648900516366},"reference-count":19,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1051\/ro:2001111","type":"journal-article","created":{"date-parts":[[2003,11,19]],"date-time":"2003-11-19T08:43:48Z","timestamp":1069231428000},"page":"189-209","source":"Crossref","is-referenced-by-count":6,"title":["Resource allocation in a mobile telephone network: A constructive repair algorithm"],"prefix":"10.1051","volume":"35","author":[{"given":"Patrice","family":"Boizumault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"David","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Housni","family":"Djellab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,8,15]]},"reference":[{"key":"R1","unstructured":"A. Borning, M. Maher, A. Martindale and M. Wilson, Constraint hierarchies and logic programming, inProc. of ICLP'89. Lisbon, Portugal (1989) 149-164."},{"key":"R2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BFb0055888","volume":"1408","author":"David","year":"1998","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"S. de Givry, G. Verfaillie and T. Schiex, Bounding the optimum of constraint optimization problems, inProc. of the 3rd Int. Conference on Principles and Practice of Constraint Programming (CP'97). Schloss Hagenberg, Austria,Lecture Notes in Comput. Sci.1330(1997) 405-419.","DOI":"10.1007\/BFb0017456"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"E.C. Freuder and R.J. Wallace, Partial constraint satisfaction.Artificial Intelligence58(19923) 21-70.","DOI":"10.1007\/3-540-61479-6_18"},{"key":"R5","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"key":"R6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"key":"R7","unstructured":"N. Jussien and P. Boizumault,Implementing constraint relaxation over finite domains using ATMS, edited by M. Jampel, E. Freuder and M. Maher, Over-Constrained Systems. Springer-Verlag,Lecture Notes in Comput. Sci.1106(1996) 265-280."},{"key":"R8","unstructured":"N. Jussien and P. Boizumault, Best-first search for property maintenance in reactive constraints systems, inInternational Logic Programming Symposium. MIT Press, Port Jefferson, NY, USA (1997) 339-353."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing.Science220(1983).","DOI":"10.1126\/science.220.4598.671"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick, Optimization by simulated annealing: Quantitative studies.J. Statist. Phys.34(1984).","DOI":"10.1007\/BF01009452"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"F. Laburthe and Y. Caseau, SALSA, a language for search algorithms, inProc. of CP'98. Springer,Lecture Notes in Comput. Sci.1520(1998) 310-324.","DOI":"10.1007\/3-540-49481-2_23"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"F. Menezes and P. Barahona, Defeasible constraint solving, inOver-Constrained Systems. Springer,Lecture Notes in Comput. Sci.1106(1996) 151-170.","DOI":"10.1007\/3-540-61479-6_20"},{"key":"R13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"Minton","year":"1992","journal-title":"Artificial Intelligence"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"G. Pesant and M. Gendreau, A view of local search in constraint programming, inProc. of CP'96. Springer,Lecture Notes in Comput. Sci.1118(1996) 353-366.","DOI":"10.1007\/3-540-61551-2_86"},{"key":"R15","unstructured":"A. Schaerf, Combining local search and look-ahead for scheduling and constraint satisfaction problems, inProc. of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97). Morgan Kaufmann, Nagoya, Japan (1997) 1254-1259."},{"key":"R16","unstructured":"T. Schiex, H. fargier and G. Verfaillie, Valued constrain satisfaction problems: Hard and easy problems, inProc. of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95). Montr\u00e9al, Canada (1995) 631-637."},{"key":"R17","unstructured":"E. Tsang,Foundations of constraint satisfaction. Academic Press (1993)."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"G. Verfaillie and T. Schiex, Solution reuse in dynamic constraint satisfaction problems, inProc. of the 12th National Conference on Artificial Intelligence (AAAI'94). Seattle, WA, USA (1994) 307-312.","DOI":"10.1142\/S0218213094000108"},{"key":"R19","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0743-1066(93)90046-J","volume":"16","author":"Wilson","year":"1993","journal-title":"J. Logic Programming"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001111\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T02:49:07Z","timestamp":1585277347000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":19,"journal-issue":{"issue":"2"},"alternative-id":["boizumault"],"URL":"https:\/\/doi.org\/10.1051\/ro:2001111","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}