{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:09:27Z","timestamp":1742972967994,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030040697"},{"type":"electronic","value":"9783030040703"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04070-3_11","type":"book-chapter","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T13:56:27Z","timestamp":1542808587000},"page":"139-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Linear Constrained Optimization Benchmark for Probabilistic Search Algorithms: The Rotated Klee-Minty Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6731-8166","authenticated-orcid":false,"given":"Michael","family":"Hellwig","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7455-8686","authenticated-orcid":false,"given":"Hans-Georg","family":"Beyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,22]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Deza, A., Nematollahi, E., Terlaky, T.: How good are interior point methods? Klee\u2013Minty cubes tighten iteration-complexity bounds. Mathematical Programming 113(1), 1\u201314 (2008)","DOI":"10.1007\/s10107-006-0044-x"},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1080\/10556780500407725","volume":"21","author":"A Deza","year":"2006","unstructured":"Deza, A., Nematollahi, E., Peyghami, R., Terlaky, T.: The central path visits all the vertices of the klee-minty cube. Optim. Methods Softw. 21(5), 851\u2013865 (2006)","journal-title":"Optim. Methods Softw."},{"key":"11_CR3","unstructured":"Hansen, N., Auger, A., Brockhoff, D., Tusar, D., Tusar, T.: COCO: performance assessment. CoRR abs\/1605.03560 (2016). http:\/\/arxiv.org\/abs\/1605.03560"},{"key":"11_CR4","unstructured":"Hansen, N., Auger, A., Mersmann, O., Tusar, T., Brockhoff, D.: COCO code repository. http:\/\/github.com\/numbbo\/coco"},{"key":"11_CR5","unstructured":"Hellwig, M., Beyer, H.: A matrix adaptation evolution strategy for constrained real-parameter optimization. In: 2018 IEEE Congress on Evolutionary Computation (CEC), Rio de Janeiro, Brazil, 8\u201313 July 2018 (2018). https:\/\/ieeexplore.ieee.org\/document\/8477950"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Hellwig, M., Beyer, H.G.: Benchmarking evolutionary algorithms for single objective real-valued constrained optimization \u2013 A critical review. Swarm Evol. Comput. (2018). https:\/\/doi.org\/10.1016\/j.swevo.2018.10.002","DOI":"10.1016\/j.swevo.2018.10.002"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: A theoretician\u2019s guide to the experimental analysis of algorithms. In: Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, vol. 59, pp. 215\u2013250 (2002)","DOI":"10.1090\/dimacs\/059\/11"},{"key":"11_CR8","unstructured":"Klee, V., Minty, G.: How good is the Simplex algorithm? Defense Technical Information Center (1970). https:\/\/books.google.at\/books?id=R843OAAACAAJ"},{"key":"11_CR9","unstructured":"Liang, J.J.: Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization (2006). http:\/\/web.mysites.ntu.edu.sg\/epnsugan\/PublicSite\/Shared%20Documents\/CEC-2006\/technical_report.pdf"},{"key":"11_CR10","unstructured":"Mallipeddi, R., Suganthan, P.N.: Problem definitions and evaluation criteria for the CEC 2010 competition on constrained real-parameter optimization (2010). http:\/\/www3.ntu.edu.sg\/home\/epnsugan\/index_files\/CEC10-Const\/TR-April-2010.pdf"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.14.1.97","volume":"14","author":"N Megiddo","year":"1989","unstructured":"Megiddo, N., Shub, M.: Boundary behavior of interior point algorithms in linear programming. Math. Oper. Res. 14(1), 97\u2013146 (1989)","journal-title":"Math. Oper. Res."},{"key":"11_CR12","unstructured":"Mezura-Montes, E., Coello, C.A.C.: What makes a constrained problem difficult to solve by an evolutionary algorithm. Technical report, Technical Report EVOCINV-01-2004, CINVESTAV-IPN, M\u00e9xico (2004)"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20(1), 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"key":"11_CR14","unstructured":"Neumaier, A.: Global optimization test problems, Vienna University. http:\/\/www.mat.univie.ac.at\/~neum\/glopt.html"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Polakova, R., Tvrd\u00edk, J.: L-SHADE with competing strategies applied to constrained optimization. In: 2017 IEEE Congress on Evolutionary Computation, CEC 2017, Donostia, San Sebasti\u00e1n, Spain, 5\u20138 June 2017, pp. 1683\u20131689 (2017)","DOI":"10.1109\/CEC.2017.7969504"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Spettel, P., Beyer, H., Hellwig, M.: A Covariance matrix self-adaptation evolution strategy for optimization under linear constraints. IEEE Trans. Evol. Comput. (2018). https:\/\/doi.org\/10.1109\/TEVC.2018.2871944","DOI":"10.1109\/TEVC.2018.2871944"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Sutton, A.M., Lunacek, M., Whitley, L.D.: Differential evolution and non-separability: using selective pressure to focus search. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 1428\u20131435. ACM (2007)","DOI":"10.1145\/1276958.1277221"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"11_CR19","unstructured":"Wu, G.H., Mallipeddi, R., Suganthan, P.N.: Problem definitions and evaluation criteria for the CEC 2017 competition on constrained real-parameter optimization (2016). http:\/\/web.mysites.ntu.edu.sg\/epnsugan\/PublicSite\/Shared%20Documents\/CEC-2017\/Constrained\/Technical%20Report%20-%20CEC2017-%20Final.pdf"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04070-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T14:13:30Z","timestamp":1614867210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-04070-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030040697","9783030040703"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04070-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"22 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Practice of Natural Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpnc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tpnc2018.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}