乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T14:44:33Z","timestamp":1724424273721},"reference-count":27,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"vor","delay-in-days":2,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP17K00028","JP17K19960","JP18H04091","JP18H05291","JP19H05485","JP19K11814","JP20H05793","JP20H05795","JP20K11670","JP20K11692"],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009023","name":"Precursory Research for Embryonic Science and Technology","doi-asserted-by":"publisher","award":["JPMJPR1753"],"id":[{"id":"10.13039\/501100009023","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1016\/j.orl.2022.05.001","type":"journal-article","created":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T15:16:05Z","timestamp":1651850165000},"page":"370-375","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A parameterized view to the robust recoverable base problem of matroids under structural uncertainty"],"prefix":"10.1016","volume":"50","author":[{"given":"Takehiro","family":"Ito","sequence":"first","affiliation":[]},{"given":"Naonori","family":"Kakimura","sequence":"additional","affiliation":[]},{"given":"Naoyuki","family":"Kamiyama","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9478-7307","authenticated-orcid":false,"given":"Yusuke","family":"Kobayashi","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9826-7074","authenticated-orcid":false,"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/j.orl.2022.05.001_br0010","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10107-014-0760-6","article-title":"Bulk-robust combinatorial optimization","volume":"149","author":"Adjiashvili","year":"2015","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2022.05.001_br0020","series-title":"Operations Research and Its Applications. The Fifth International Symposium, ISORA'05 Tibet, China, August 8\u201313, 2005 Proceedings","first-page":"171","article-title":"Pseudo-polynomial algorithms for min-max and min-max regret problems","author":"Aissi","year":"2005"},{"issue":"2","key":"10.1016\/j.orl.2022.05.001_br0030","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.ejor.2006.03.023","article-title":"Approximation of min-max and min-max regret versions of some combinatorial optimization problems","volume":"179","author":"Aissi","year":"2007","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.orl.2022.05.001_br0040","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","article-title":"Min-max and min-max regret versions of combinatorial optimization problems: a survey","volume":"197","author":"Aissi","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.orl.2022.05.001_br0050","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.trb.2015.06.001","article-title":"The recoverable robust facility location problem","volume":"79","author":"\u00c1lvarez-Miranda","year":"2015","journal-title":"Transp. Res., Part B, Methodol."},{"issue":"1","key":"10.1016\/j.orl.2022.05.001_br0060","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.2014.0606","article-title":"The recoverable robust two-level network design problem","volume":"27","author":"\u00c1lvarez-Miranda","year":"2015","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"10.1016\/j.orl.2022.05.001_br0070","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011424","article-title":"On the complexity of a class of combinatorial optimization problems with uncertainty","volume":"90","author":"Averbakh","year":"2001","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2022.05.001_br0080","series-title":"Recoverable Robustness in Combinatorial Optimization","author":"B\u00fcsing","year":"2010"},{"issue":"1","key":"10.1016\/j.orl.2022.05.001_br0090","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.20487","article-title":"Recoverable robust shortest path problems","volume":"59","author":"B\u00fcsing","year":"2012","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.orl.2022.05.001_br0100","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s11590-011-0307-1","article-title":"Recoverable robust knapsacks: the discrete scenario case","volume":"5","author":"B\u00fcsing","year":"2011","journal-title":"Optim. Lett."},{"key":"10.1016\/j.orl.2022.05.001_br0110","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"key":"10.1016\/j.orl.2022.05.001_br0120","series-title":"Proceedings of the 52nd Annual Symposium on Foundations of Computer Science","first-page":"580","article-title":"Enumerative lattice algorithms in any norm via M-ellipsoid coverings","author":"Dadush","year":"2011"},{"key":"10.1016\/j.orl.2022.05.001_br0130","series-title":"Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1445","article-title":"Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms","author":"Dadush","year":"2012"},{"key":"10.1016\/j.orl.2022.05.001_br0140","series-title":"46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings","first-page":"367","article-title":"How to pay, come what may: approximation algorithms for demand-robust covering problems","author":"Dhamdhere","year":"2005"},{"issue":"3","key":"10.1016\/j.orl.2022.05.001_br0150","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1002\/net.21624","article-title":"Robust recoverable perfect matchings","volume":"66","author":"Dourado","year":"2015","journal-title":"Networks"},{"key":"10.1016\/j.orl.2022.05.001_br0160","series-title":"Combinatorial Structures and Their Applications","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"Edmonds","year":"1970"},{"issue":"1","key":"10.1016\/j.orl.2022.05.001_br0170","doi-asserted-by":"crossref","DOI":"10.1145\/2746226","article-title":"Robust and maxmin optimization under matroid and knapsack uncertainty sets","volume":"12","author":"Gupta","year":"2016","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.orl.2022.05.001_br0190","series-title":"Operations Research Proceedings 2012, Selected Papers of the International Annual Conference of the German Operations Research Society (GOR)","first-page":"147","article-title":"Recoverable robust combinatorial optimization problems","author":"Kasperski","year":"2012"},{"issue":"1\u20132","key":"10.1016\/j.orl.2022.05.001_br0200","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ipl.2012.10.001","article-title":"Approximating the min-max (regret) selecting items problem","volume":"113","author":"Kasperski","year":"2013","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10.1016\/j.orl.2022.05.001_br0210","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10479-009-0564-x","article-title":"A randomized algorithm for the min-max selecting items problem with uncertain weights","volume":"172","author":"Kasperski","year":"2009","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.orl.2022.05.001_br0220","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.dam.2017.08.014","article-title":"Robust recoverable and two-stage selection problems","volume":"233","author":"Kasperski","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2022.05.001_br0230","series-title":"Robust Discrete Optimization and Its Applications","author":"Kouvelis","year":"1997"},{"issue":"4","key":"10.1016\/j.orl.2022.05.001_br0240","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.orl.2022.05.001_br0250","series-title":"Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems","first-page":"1","article-title":"The concept of recoverable robustness, linear programming recovery, and railway applications","author":"Liebchen","year":"2009"},{"issue":"2","key":"10.1016\/j.orl.2022.05.001_br0260","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1017\/S0305004100051677","article-title":"Rado's theorem for polymatroids","volume":"78","author":"McDiarmid","year":"1975","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"10.1016\/j.orl.2022.05.001_br0270","series-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier","year":"2006"},{"key":"10.1016\/j.orl.2022.05.001_br0280","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637722000578?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637722000578?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T10:40:45Z","timestamp":1711968045000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637722000578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["S0167637722000578"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2022.05.001","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2022,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A parameterized view to the robust recoverable base problem of matroids under structural uncertainty","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2022.05.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}