{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,23]],"date-time":"2023-07-23T04:16:40Z","timestamp":1690085800871},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T00:00:00Z","timestamp":1686873600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T00:00:00Z","timestamp":1686873600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10878-023-01054-1","type":"journal-article","created":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T20:01:48Z","timestamp":1686945708000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming"],"prefix":"10.1007","volume":"45","author":[{"given":"Meijia","family":"Han","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8698-0024","authenticated-orcid":false,"given":"Wenxing","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,16]]},"reference":[{"key":"1054_CR1","doi-asserted-by":"crossref","unstructured":"Artmann S, Weismantel R, Zenklusen R (2017) A strongly polynomial algorithm for bimodular integer linear programming. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, p. 1206-1219. Association for Computing Machinery, New York, USA","DOI":"10.1145\/3055399.3055473"},{"key":"1054_CR2","unstructured":"Bandeira AS, Scheinberg K, Vicente LN (2013) On partial sparse recovery. arXiv preprint arXiv:1304.2809 (2013)"},{"issue":"4","key":"1054_CR3","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1016\/j.apm.2009.07.014","volume":"34","author":"A Billionnet","year":"2010","unstructured":"Billionnet A (2010) Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem. Appl Math Modell 34(4):1042\u20131050","journal-title":"Appl Math Modell"},{"issue":"2","key":"1054_CR4","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1287\/moor.23.2.390","volume":"23","author":"R Chandrasekaran","year":"1998","unstructured":"Chandrasekaran R, Kabadi S, Sridhar R (1998) Integer solution for linear complementarity problem. Math Oper Res 23(2):390\u2013402","journal-title":"Math Oper Res"},{"key":"1054_CR5","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.proeng.2016.01.248","volume":"137","author":"J Chen","year":"2016","unstructured":"Chen J, Kou L, Cui X (2016) An approximation algorithm for the minimum vertex cover problem. Procedia Eng 137:180\u2013185","journal-title":"Procedia Eng"},{"key":"1054_CR6","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"R Dakin","year":"1965","unstructured":"Dakin R (1965) A tree-search algorithm for mixed integer programming problems. Comput J 8:250\u2013255","journal-title":"Comput J"},{"issue":"3","key":"1054_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna E, Rothberg E, Pape CL (2005) Exploring relaxations induced neighborhoods to improve mip solutions. Math Program 102(3):71\u201390","journal-title":"Math Program"},{"key":"1054_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.laa.2018.08.004","volume":"557","author":"D Dubey","year":"2018","unstructured":"Dubey D, Neogy S (2018) Total dual integrality and integral solutions of the linear complementarity problem. Linear Algebra Appl 557:359\u2013374","journal-title":"Linear Algebra Appl"},{"key":"1054_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J Edmonds","year":"1977","unstructured":"Edmonds J, Giles R (1977) A min-max relation for submodular functions on graphs. Ann Discrete Math 1:185\u2013204","journal-title":"Ann Discrete Math"},{"issue":"5","key":"1054_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory RE (1958) Outline of an algorithm for integer solutions to linear programs. Bull Am Math Soc 64(5):275\u2013278","journal-title":"Bull Am Math Soc"},{"issue":"1","key":"1054_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0024-3795(76)90047-1","volume":"13","author":"AJ Hoffman","year":"1976","unstructured":"Hoffman AJ (1976) Total unimodularity and combinatorial theorems. Linear Algebra Appl 13(1):103\u2013108","journal-title":"Linear Algebra Appl"},{"key":"1054_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-010-0417-z","volume":"127","author":"A Juditsky","year":"2011","unstructured":"Juditsky A, Nemirovski A (2011) On verifiable sufficient conditions for sparse signal recovery via $$l_1-$$minimization. Math Progr 127:57\u201388","journal-title":"Math Progr"},{"issue":"1","key":"1054_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.3934\/naco.2014.4.25","volume":"4","author":"L Kong","year":"2014","unstructured":"Kong L, Xiu N, Liu G (2014) Partial $$s$$-goodness for partially sparse signal recovery. Numer Algeb Control Optimiz 4(1):25\u201338","journal-title":"Numer Algeb Control Optimiz"},{"key":"1054_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_16","volume-title":"Mixed Integer Programming Computation","author":"A Lodi","year":"2010","unstructured":"Lodi A (2010) Mixed Integer Programming Computation. Springer, Berlin, Heidelberg"},{"key":"1054_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-019-09418-9","volume":"26","author":"W Zhang","year":"2020","unstructured":"Zhang W, Nicholson C (2020) Objective scaling ensemble approach for integer linear programming. J Heuristics 26:1\u201319","journal-title":"J Heuristics"},{"issue":"2","key":"1054_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s40305-014-0043-1","volume":"2","author":"Y Zhao","year":"2014","unstructured":"Zhao Y (2014) Equivalence and strong equivalence between sparsest and least $$l_1-$$norm nonnegative solutions to linear systems and their applications. J Oper Res Soc China 2(2):171\u2013193","journal-title":"J Oper Res Soc China"},{"key":"1054_CR17","doi-asserted-by":"crossref","unstructured":"Zhao, Y (2018) Sparse optimization theory and methods. CRC Press. Taylor & Francis Group","DOI":"10.1201\/9781315113142"},{"key":"1054_CR18","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1137\/110847445","volume":"22","author":"Y Zhao","year":"2012","unstructured":"Zhao Y, Li D (2012) Reweighted $$l_1-$$minimization for sparse solutions to underdetermined linear systems. SIAM J Optim 22:1065\u20131088","journal-title":"SIAM J Optim"},{"issue":"1","key":"1054_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/moor.2016.0791","volume":"42","author":"Y Zhao","year":"2017","unstructured":"Zhao Y, Luo Z (2017) Constructing new weighted $$l_1-$$algorithms for the sparsest points of polyhedral sets. Math Oper Res 42(1):57\u201376","journal-title":"Math Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01054-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01054-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01054-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T04:08:55Z","timestamp":1689998935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01054-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,16]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1054"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01054-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,16]]},"assertion":[{"value":"30 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"124"}}