{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:28Z","timestamp":1725544588566},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_19","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"242-253","source":"Crossref","is-referenced-by-count":8,"title":["Combining Multiple Heuristics"],"prefix":"10.1007","author":[{"given":"Tzur","family":"Sayag","sequence":"first","affiliation":[]},{"given":"Shai","family":"Fine","sequence":"additional","affiliation":[]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624216","volume-title":"Neural network learning: Theoretical foundations","author":"M. Anthony","year":"1999","unstructured":"Anthony, M., Bartlett, P.L.: Neural network learning: Theoretical foundations. Cambridge University Press, Cambridge (1999)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1145\/109648.109682","volume-title":"SCG 1991: Proceedings of the seventh annual symposium on Computational geometry","author":"B. Aronov","year":"1991","unstructured":"Aronov, B., Matousek, J., Sharir, M.: On the sum of squares of cell complexities in hyperplane arrangements. In: SCG 1991: Proceedings of the seventh annual symposium on Computational geometry, pp. 307\u2013313. ACM Press, New York (1991), doi:10.1145\/109648.109682"},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N. Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D.P., Haussler, D., Schapire, R.E., Warmuth, M.K.: How to use expert advice. Journal of the ACM\u00a044(3), 427\u2013485 (1997)","journal-title":"Journal of the ACM"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational geometry algorithms and applications, ch. 8","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, P.: Computational geometry algorithms and applications, ch. 8, 2nd revised edn., pp. 172\u2013180. Springer, Heidelberg (2000)","edition":"2"},{"key":"19_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in combinatorial geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in combinatorial geometry. Springer, New York (1987)"},{"key":"19_CR6","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Automated Reasoning","author":"E. Giunchiglia","year":"2001","unstructured":"Giunchiglia, E., Maratea, M., Tacchella, A., Zambonin, D.: Evaluating search heuristics and optimization techniques in propositional satisfiability. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, Springer, Heidelberg (2001)"},{"key":"19_CR7","first-page":"529","volume-title":"Handbook of Discrete and Computational Geometry","author":"D. Halperin","year":"2004","unstructured":"Halperin, D.: Arrangements. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, pp. 529\u2013562. CRC Press LLC, Boca Raton (2004)"},{"key":"19_CR8","volume-title":"Approximation algorithms for NP-hard problems","author":"D.S. Hochbaum","year":"1997","unstructured":"Hochbaum, D.S.: Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston (1997)"},{"key":"19_CR9","unstructured":"Kullmann, O.: Heuristics for SAT algorithms: Searching for some foundations. 23 pages (September 1998), updated September 1999 w.r.t. running times, http:\/\/cs-svr1.swan.ac.uk\/~csoliver\/heur2letter.ps.gz"},{"key":"19_CR10","unstructured":"Li, C.-M., Anbulagan,: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI 1997), Nagoya, Japan, August 23\u201329 1997, pp. 366\u2013371 (1997)"},{"key":"19_CR11","series-title":"Prentice-Hall International Series in Industrial and Systems Engineering","volume-title":"Scheduling theory, algorithms and systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M.: Scheduling theory, algorithms and systems. Prentice-Hall International Series in Industrial and Systems Engineering. Prentice-Hall, Englewood Cliffs (1995)"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T23:17:17Z","timestamp":1586733437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11672142_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}