乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:17:53Z","timestamp":1740140273209,"version":"3.37.3"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1129871"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-12-1-0154"],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1016\/j.disopt.2015.07.005","type":"journal-article","created":{"date-parts":[[2015,8,20]],"date-time":"2015-08-20T19:03:32Z","timestamp":1440097412000},"page":"87-102","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["Polyhedral results for a class of cardinality constrained submodular minimization problems"],"prefix":"10.1016","volume":"24","author":[{"given":"Jiajin","family":"Yu","sequence":"first","affiliation":[]},{"given":"Shabbir","family":"Ahmed","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2015.07.005_br000005","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/mnsc.12.9.670","article-title":"Warehouse location under continuous economies of scale","volume":"12","author":"Feldman","year":"1966","journal-title":"Manage. Sci."},{"issue":"1","key":"10.1016\/j.disopt.2015.07.005_br000010","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1002\/net.10080","article-title":"The facility location problem with general cost functions","volume":"42","author":"Hajiaghayi","year":"2003","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.disopt.2015.07.005_br000015","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1002\/net.20315","article-title":"Integrating facility location and production planning decisions","volume":"55","author":"Romeijn","year":"2010","journal-title":"Networks"},{"year":"2009","series-title":"Combinatorial optimization problems with concave costs","author":"Stratila","key":"10.1016\/j.disopt.2015.07.005_br000020"},{"issue":"5","key":"10.1016\/j.disopt.2015.07.005_br000025","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.orl.2008.04.006","article-title":"Polymatroids and mean-risk minimization in discrete optimization","volume":"36","author":"Atamt\u00fcrk","year":"2008","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10.1016\/j.disopt.2015.07.005_br000030","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(81)90004-4","article-title":"Stochastic spanning tree problem","volume":"3","author":"Ishii","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disopt.2015.07.005_br000035","series-title":"Proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX","first-page":"338","article-title":"Approximation algorithms for reliable stochastic combinatorial optimization","author":"Nikolova","year":"2010"},{"issue":"4","key":"10.1016\/j.disopt.2015.07.005_br000040","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/nav.20282","article-title":"Capacitated warehouse location model with risk pooling","volume":"55","author":"Ozsen","year":"2008","journal-title":"Naval Res. Logist. (NRL)"},{"key":"10.1016\/j.disopt.2015.07.005_br000045","series-title":"Facets of Combinatorial Optimization","first-page":"271","article-title":"Exact algorithms for combinatorial optimization problems with submodular objective functions","author":"Baumann","year":"2013"},{"key":"10.1016\/j.disopt.2015.07.005_br000050","series-title":"Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS","first-page":"755","article-title":"Approximability of combinatorial problems with multi-agent submodular cost functions","author":"Goel","year":"2009"},{"key":"10.1016\/j.disopt.2015.07.005_br000055","unstructured":"M.X. Goemans, J.A. Soto, Symmetric submodular function minimization under hereditary family constraints, CoRR abs\/1007.2140."},{"key":"10.1016\/j.disopt.2015.07.005_br000060","series-title":"Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS","first-page":"671","article-title":"Submodular function minimization under covering constraints","author":"Iwata","year":"2009"},{"key":"10.1016\/j.disopt.2015.07.005_br000065","series-title":"SODA\u201909: Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"535","article-title":"Approximating submodular functions everywhere","author":"Goemans","year":"2009"},{"year":"1998","series-title":"Supermodularity and Complementarity","author":"Topkis","key":"10.1016\/j.disopt.2015.07.005_br000070"},{"key":"10.1016\/j.disopt.2015.07.005_br000075","series-title":"Combinatorial Structures and Their Applications","first-page":"68","article-title":"Submodular functions, matroids, and certain polyhedra","author":"Edmonds","year":"1971"},{"key":"10.1016\/j.disopt.2015.07.005_br000080","series-title":"Mathematical Programming The State of the Art","first-page":"235","article-title":"Submodular functions and convexity","author":"Lov\u00e1sz","year":"1983"},{"issue":"6","key":"10.1016\/j.disopt.2015.07.005_br000085","doi-asserted-by":"crossref","first-page":"1715","DOI":"10.1137\/100783352","article-title":"Submodular approximation: Sampling-based algorithms and lower bounds","volume":"40","author":"Svitkina","year":"2011","journal-title":"SIAM J. Comput."},{"year":"1979","series-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/j.disopt.2015.07.005_br000090"},{"issue":"2","key":"10.1016\/j.disopt.2015.07.005_br000095","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1287\/moor.14.2.362","article-title":"Maximizing classes of two-parameter objectives over matroids","volume":"14","author":"Hassin","year":"1989","journal-title":"Math. Oper. Res."},{"issue":"4","key":"10.1016\/j.disopt.2015.07.005_br000100","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s00454-004-1138-y","article-title":"Convex combinatorial optimization","volume":"32","author":"Onn","year":"2004","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20132","key":"10.1016\/j.disopt.2015.07.005_br000105","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10107-009-0298-1","article-title":"Maximizing a class of submodular utility functions","volume":"128","author":"Ahmed","year":"2011","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.disopt.2015.07.005_br000110","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/opre.1120.1135","article-title":"Probabilistic set covering with correlations","volume":"61","author":"Ahmed","year":"2013","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.disopt.2015.07.005_br000115","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","article-title":"Sequence independent lifting in mixed integer programming","volume":"4","author":"Gu","year":"2000","journal-title":"J. Comb. Optim."},{"issue":"4","key":"10.1016\/j.disopt.2015.07.005_br000120","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.disopt.2009.03.002","article-title":"The submodular knapsack polytope","volume":"6","author":"Atamt\u00fcrk","year":"2009","journal-title":"Discrete Optim."},{"issue":"4","key":"10.1016\/j.disopt.2015.07.005_br000125","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/opre.51.4.543.16101","article-title":"Worst-case value-at-risk and robust portfolio optimization: A conic programming approach","volume":"51","author":"Ghaoui","year":"2003","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.disopt.2015.07.005_br000130","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1137\/S1052623401399903","article-title":"Optimal inequalities in probability theory: A convex optimization approach","volume":"15","author":"Bertsimas","year":"2005","journal-title":"SIAM J. Optim."},{"issue":"2","key":"10.1016\/j.disopt.2015.07.005_br000135","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528615000444?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528615000444?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T00:10:49Z","timestamp":1712535049000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528615000444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":27,"alternative-id":["S1572528615000444"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2015.07.005","relation":{},"ISSN":["1572-5286"],"issn-type":[{"type":"print","value":"1572-5286"}],"subject":[],"published":{"date-parts":[[2017,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Polyhedral results for a class of cardinality constrained submodular minimization problems","name":"articletitle","label":"Article Title"},{"value":"Discrete Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disopt.2015.07.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2015 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}