乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:25:03Z","timestamp":1740029103318,"version":"3.37.3"},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2010,8,1]],"date-time":"2010-08-01T00:00:00Z","timestamp":1280620800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1016\/j.disopt.2010.03.004","type":"journal-article","created":{"date-parts":[[2010,4,19]],"date-time":"2010-04-19T09:02:08Z","timestamp":1271667728000},"page":"136-148","source":"Crossref","is-referenced-by-count":20,"title":["General approximation schemes for min\u2013max (regret) versions of some (pseudo-)polynomial problems"],"prefix":"10.1016","volume":"7","author":[{"given":"Hassene","family":"Aissi","sequence":"first","affiliation":[]},{"given":"Cristina","family":"Bazgan","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Vanderpooten","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2010.03.004_b1","series-title":"Robust Discrete Optimization and its Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","author":"Kouvelis","year":"1997"},{"issue":"2","key":"10.1016\/j.disopt.2010.03.004_b2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","article-title":"Min\u2013max and min\u2013max regret versions of combinatorial optimization problems: a survey","volume":"197","author":"Aissi","year":"2009","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.disopt.2010.03.004_b3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.ejor.2006.03.023","article-title":"Approximation of min\u2013max and min\u2013max regret versions of some combinatorial optimization problems","volume":"179","author":"Aissi","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.disopt.2010.03.004_b4","doi-asserted-by":"crossref","unstructured":"C.H. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, in: IEEE Symposium on Foundations of Computer Science, FOCS 2000, Redondo Beach, California, USA, 2000, pp. 86\u201392.","DOI":"10.1109\/SFCS.2000.892068"},{"issue":"1","key":"10.1016\/j.disopt.2010.03.004_b5","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","article-title":"Approximation of Pareto optima in multiple-objective, shortest-path problems","volume":"35","author":"Warburton","year":"1987","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.disopt.2010.03.004_b6","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","article-title":"Approximation schemes for the restricted shortest path","volume":"17","author":"Hassin","year":"1992","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"10.1016\/j.disopt.2010.03.004_b7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.orl.2003.06.003","article-title":"A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem","volume":"32","author":"Hong","year":"2004","journal-title":"Operations Research Letters"},{"issue":"2","key":"10.1016\/j.disopt.2010.03.004_b8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.tcs.2007.03.006","article-title":"Approximation schemes for a class of subset selection problems","volume":"382","author":"Pruhs","year":"2007","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10.1016\/j.disopt.2010.03.004_b9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","article-title":"When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (fptas)?","volume":"12","author":"Woeginger","year":"2000","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.disopt.2010.03.004_b10","unstructured":"M. Mahajan, V. Vinay, Determinants: combinatorics, algorithms, and complexity, in: Proceedings of the Eigth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, SODA 1997, New Orleans, USA, 1997, pp. 730\u2013738."},{"issue":"4","key":"10.1016\/j.disopt.2010.03.004_b11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","article-title":"System of distinct representatives and linear algebra","volume":"718","author":"Edmonds","year":"1967","journal-title":"Journal of Research of the National Bureau of Standards"},{"year":"1976","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/j.disopt.2010.03.004_b12"},{"year":"1994","series-title":"Computational Complexity","author":"Papadimitriou","key":"10.1016\/j.disopt.2010.03.004_b13"},{"issue":"1\u20133","key":"10.1016\/j.disopt.2010.03.004_b14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2003.12.001","article-title":"The combinatorial approach yields an NC algorithm for computing Pfaffians","volume":"143","author":"Mahajan","year":"2004","journal-title":"Discrete Applied Mathematics"},{"issue":"12","key":"10.1016\/j.disopt.2010.03.004_b15","doi-asserted-by":"crossref","first-page":"1603","DOI":"10.1287\/mnsc.48.12.1603.445","article-title":"Approximating multiobjective knapsack problems","volume":"48","author":"Erlebach","year":"2002","journal-title":"Management Science"},{"issue":"2","key":"10.1016\/j.disopt.2010.03.004_b16","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/opre.44.2.407","article-title":"On the max\u2013min 0\u20131 knapsack problem with robust optimization applications","volume":"44","author":"Yu","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/j.disopt.2010.03.004_b17","series-title":"Graph Theory","volume":"vol. 21","author":"Tutte","year":"1984"},{"key":"10.1016\/j.disopt.2010.03.004_b18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0166-218X(87)90067-9","article-title":"Exact arborescences, matching and cycles","volume":"16","author":"Barahona","year":"1987","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.disopt.2010.03.004_b19","series-title":"Graph Theory and Crystal Physics","first-page":"43","article-title":"Graph theory and theoretical physics","author":"Kasteleyn","year":"1967"},{"key":"10.1016\/j.disopt.2010.03.004_b20","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528610000113?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528610000113?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T02:06:03Z","timestamp":1740017163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528610000113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["S1572528610000113"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2010.03.004","relation":{},"ISSN":["1572-5286"],"issn-type":[{"type":"print","value":"1572-5286"}],"subject":[],"published":{"date-parts":[[2010,8]]}}}