乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:46:10Z","timestamp":1740116770090,"version":"3.37.3"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFA1000403"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11991022"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002367","name":"Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["XDA27000000"],"id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1016\/j.cor.2023.106471","type":"journal-article","created":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T04:03:56Z","timestamp":1699329836000},"page":"106471","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Generating linear programming instances with controllable rank and condition number"],"prefix":"10.1016","volume":"162","author":[{"given":"Anqi","family":"Li","sequence":"first","affiliation":[]},{"given":"Congying","family":"Han","sequence":"additional","affiliation":[]},{"given":"Tiande","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Bonan","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2023.106471_b1","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1090\/dimacs\/026\/18","article-title":"Random generation of test instances with controlled attributes","volume":"26","author":"Asahiro","year":"1996","journal-title":"Cliques Color. Satisf.: Ser. Discr. Math. Theor. Comput. Sicence"},{"key":"10.1016\/j.cor.2023.106471_b2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.artint.2016.04.003","article-title":"Aslib: A benchmark library for algorithm selection","volume":"237","author":"Bischl","year":"2016","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/j.cor.2023.106471_b3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s12532-019-00170-6","article-title":"Generation techniques for linear programming instances with controllable properties","volume":"12","author":"Bowly","year":"2020","journal-title":"Math. Program. Comput."},{"issue":"9","key":"10.1016\/j.cor.2023.106471_b4","article-title":"The netlib mathematical software repository","volume":"1","author":"Browne","year":"1995","journal-title":"D-lib Mag."},{"issue":"1","key":"10.1016\/j.cor.2023.106471_b5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0893-9659(02)00142-8","article-title":"A mixed evolutionary-statistical analysis of an algorithm\u2019s complexity","volume":"16","author":"Cotta","year":"2003","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/j.cor.2023.106471_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105707","article-title":"Improved instance generation for kidney exchange programmes","volume":"141","author":"Delorme","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106471_b7","series-title":"2013 IEEE Congress on Evolutionary Computation","first-page":"2086","article-title":"Instance generator for the quadratic assignment problem with additively decomposable cost function","author":"Drugan","year":"2013"},{"key":"10.1016\/j.cor.2023.106471_b8","series-title":"International Conference on Parallel Problem Solving from Nature","first-page":"869","article-title":"Feature-based diversity optimization for problem instance classification","author":"Gao","year":"2016"},{"issue":"4","key":"10.1016\/j.cor.2023.106471_b9","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1162\/evco.2006.14.4.433","article-title":"Evolving combinatorial problem instances that are difficult to solve","volume":"14","author":"van Hemert","year":"2006","journal-title":"Evol. Comput."},{"issue":"2","key":"10.1016\/j.cor.2023.106471_b10","first-page":"105","article-title":"Test problem generation of binary knapsack problem variants and the implications of their use","volume":"18","author":"Hill","year":"2011","journal-title":"Int. J. Oper. Quant. Manag."},{"issue":"2","key":"10.1016\/j.cor.2023.106471_b11","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/mnsc.46.2.302.11930","article-title":"The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance","volume":"46","author":"Hill","year":"2000","journal-title":"Manage. Sci."},{"issue":"2","key":"10.1016\/j.cor.2023.106471_b12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1287\/opre.42.2.201","article-title":"Needed: An empirical science of algorithms","volume":"42","author":"Hooker","year":"1994","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106471_b13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02430364","article-title":"Testing heuristics: We have it all wrong","volume":"1","author":"Hooker","year":"1995","journal-title":"J. Heuristics"},{"key":"10.1016\/j.cor.2023.106471_b14","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","article-title":"Paramils: an automatic algorithm configuration framework","volume":"36","author":"Hutter","year":"2009","journal-title":"J. Artificial Intelligence Res."},{"issue":"5","key":"10.1016\/j.cor.2023.106471_b15","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","article-title":"NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems","volume":"20","author":"Klingman","year":"1974","journal-title":"Manag. Sci."},{"issue":"2","key":"10.1016\/j.cor.2023.106471_b16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","article-title":"MIPLIB 2010","volume":"3","author":"Koch","year":"2011","journal-title":"Math. Program. Comput."},{"key":"10.1016\/j.cor.2023.106471_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106019","article-title":"Evolving test instances of the Hamiltonian completion problem","volume":"149","author":"Lechien","year":"2023","journal-title":"Comput. Oper. Res."},{"year":"2006","series-title":"How to generate random matrices from the classical compact groups","author":"Mezzadri","key":"10.1016\/j.cor.2023.106471_b18"},{"issue":"6","key":"10.1016\/j.cor.2023.106471_b19","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1002\/1520-6750(199210)39:6<839::AID-NAV3220390609>3.0.CO;2-C","article-title":"Partial polyhedral description and generation of discrete optimization problems with known optima","volume":"39","author":"Pilcher","year":"1992","journal-title":"Nav. Res. Logist."},{"key":"10.1016\/j.cor.2023.106471_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105065","article-title":"A study on the pickup and delivery problem with time windows: Matheuristics and new instances","volume":"124","author":"Sartori","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106471_b21","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.cor.2015.04.022","article-title":"Generating new test instances by evolving in instance space","volume":"63","author":"Smith-Miles","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106471_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105184","article-title":"Revisiting where are the hard knapsack problems? via instance space analysis","volume":"128","author":"Smith-Miles","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106471_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105661","article-title":"Instance space analysis and algorithm selection for the job shop scheduling problem","volume":"141","author":"Strassl","year":"2022","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2023.106471_b24","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1287\/moor.16.4.671","article-title":"Probabilistic models for linear programming","volume":"16","author":"Todd","year":"1991","journal-title":"Math. Oper. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823003350?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823003350?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T20:49:11Z","timestamp":1736369351000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054823003350"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":24,"alternative-id":["S0305054823003350"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2023.106471","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2024,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generating linear programming instances with controllable rank and condition number","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2023.106471","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"106471"}}