{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:43Z","timestamp":1725664483531},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540604280"},{"type":"electronic","value":"9783540455950"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60428-6_35","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:27:35Z","timestamp":1330280855000},"page":"403-407","source":"Crossref","is-referenced-by-count":0,"title":["A non-diffident combinatorial optimization algorithm"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Trombettoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Neveu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Berlandier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria -Cristina","family":"Riff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mouhssine","family":"Bouzoubaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"35_CR1","unstructured":"Cosytec. Chip Users' Reference Manual, 1991."},{"key":"35_CR2","unstructured":"ILOG, 2 Av. Galli\u00e9ni, F-94253 Gentilly. Ilog Solver Users' Reference Manual, 1994."},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"K. Lee, H. Leong. An improved lower bound for channel routing problems. In IEEE International Symposium on Circuits and Systems, 1991.","DOI":"10.1109\/ISCAS.1991.176791"},{"issue":"6","key":"35_CR4","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1002\/net.3230230603","volume":"23","author":"K. Malik","year":"1993","unstructured":"K. Malik, G. Yu. A branch and bound algorithm for the capaciated minimum spanning tree problem. Networks, 23(6):525\u2013532, 1993.","journal-title":"Networks"},{"key":"35_CR5","unstructured":"P. Prosser. Binary constraint satisfaction problems: Some are harder than others. In Proc. ECAI, pages 95\u201399, Amsterdam, the Netherlands, 1994."},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"D. Sabin, E. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Proc. ECAI, Amsterdam, Netherlands, 1994.","DOI":"10.1007\/3-540-58601-6_86"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60428-6_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T16:56:19Z","timestamp":1713632179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60428-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540604280","9783540455950"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-60428-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}