{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:48:37Z","timestamp":1725490117763},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74446-7_7","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T07:39:15Z","timestamp":1187681955000},"page":"91-105","source":"Crossref","is-referenced-by-count":2,"title":["Mixed Models for the Analysis of Local Search Components"],"prefix":"10.1007","author":[{"given":"J\u00f8rgen","family":"Bang-Jensen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Chiarandini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Goegebeur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bent","family":"J\u00f8rgensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H. Hoos","year":"2004","unstructured":"Hoos, H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2004)"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R. Barr","year":"1995","unstructured":"Barr, R., Golden, B., Kelly, J., Resende, M., Stewart, W.: Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics\u00a01(1), 9\u201332 (1995)","journal-title":"Journal of Heuristics"},{"issue":"1","key":"7_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.8.1.1","volume":"8","author":"C.C. McGeoch","year":"1996","unstructured":"McGeoch, C.C.: Toward an experimental method for algorithm simulation. INFORMS Journal on Computing\u00a08(1), 1\u201315 (1996)","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/A:1011319115230","volume":"7","author":"R.L. Rardin","year":"2001","unstructured":"Rardin, R.L., Uzsoy, R.: Experimental evaluation of heuristic optimization algorithms: A tutorial. Journal of Heuristics\u00a07(3), 261\u2013304 (2001)","journal-title":"Journal of Heuristics"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/ijoc.12.1.24.11899","volume":"12","author":"M. Coffin","year":"2000","unstructured":"Coffin, M., Saltzman, M.J.: Statistical analysis of computational tests of algorithms and heuristics. INFORMS Journal on Computing\u00a012(1), 24\u201344 (2000)","journal-title":"INFORMS Journal on Computing"},{"key":"7_CR6","first-page":"32","volume":"1","author":"J.N. Hooker","year":"1996","unstructured":"Hooker, J.N.: Testing heuristics: We have it all wrong. Journal of Heuristics\u00a01, 32\u201342 (1996)","journal-title":"Journal of Heuristics"},{"volume-title":"Linear Mixed Models in Practice - A SAS-Oriented Approach","year":"1997","key":"7_CR7","unstructured":"Molenberghs, G., Verbeke, G. (eds.): Linear Mixed Models in Practice - A SAS-Oriented Approach. Springer, Heidelberg (1997)"},{"key":"7_CR8","volume-title":"Design and Analysis of Experiments","author":"D.C. Montgomery","year":"2005","unstructured":"Montgomery, D.C.: Design and Analysis of Experiments, 6th edn. John Wiley & Sons, Chichester (2005)","edition":"6"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/moor.6.3.319","volume":"6","author":"E. Zemel","year":"1981","unstructured":"Zemel, E.: Measuring the quality of approximate solutions to zero-one programming problems. Mathematics of operations research\u00a06(3), 319\u2013332 (1981)","journal-title":"Mathematics of operations research"},{"key":"7_CR10","unstructured":"Birattari, M.: On the estimation of the expected performance of a metaheuristic on a class of instances. how many instances, how many runs? Tech. Rep. TR\/IRIDIA\/2004-01, IRIDIA, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium (2004)"},{"key":"7_CR11","volume-title":"Models for Discrete Longitudinal Data","author":"G. Molenberghs","year":"2005","unstructured":"Molenberghs, G., Verbeke, G.: Models for Discrete Longitudinal Data. Springer, Heidelberg (2005)"},{"key":"7_CR12","unstructured":"Bang-Jensen, J., Chiarandini, M., Morling, P.: A computational investigation on heuristics for 2-edge connectivity augmentation. Submitted to journal (2007)"},{"key":"7_CR13","series-title":"electronic edn","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. electronic edn. Springer-Verlag, New York, Berlin (2000)","edition":"2"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-3-540-30559-0_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Conforti","year":"2004","unstructured":"Conforti, M., Galluccio, A., Proietti, G.: Edge-connectivity augmentation and network matrices. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 355\u2013364. Springer, Heidelberg (2004)"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(01)00285-X","volume":"82","author":"G.R. Raidl","year":"2002","unstructured":"Raidl, G.R., Ljubic, I.: Evolutionary local search for the edge-biconnectivity augmentation problem. Information Processing Letters\u00a082(1), 39\u201345 (2002)","journal-title":"Information Processing Letters"},{"key":"7_CR16","volume-title":"Introduction to algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74446-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:27:50Z","timestamp":1619519270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74446-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744450"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74446-7_7","relation":{},"subject":[]}}