{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T05:15:48Z","timestamp":1778822148731,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.disopt.2026.100955","type":"journal-article","created":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:23:51Z","timestamp":1778603031000},"page":"100955","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Vertex packing linear programs and critical independent sets"],"prefix":"10.1016","volume":"61","author":[{"given":"C.E.","family":"Larson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2026.100955_b1","series-title":"Computers and Intractability","first-page":"x+338","author":"Garey","year":"1979"},{"key":"10.1016\/j.disopt.2026.100955_b2","series-title":"Combinatorial Optimization: Polyhedra and Efficiency","volume":"vol. 24","author":"Schrijver","year":"2003"},{"issue":"3","key":"10.1016\/j.disopt.2026.100955_b3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","article-title":"Integer programming: methods, uses, computations","volume":"12","author":"Balinski","year":"1965","journal-title":"Manag. Sci."},{"key":"10.1016\/j.disopt.2026.100955_b4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.disopt.2026.100955_b5","series-title":"Matching theory","first-page":"xxvii+544","volume":"vol. 121","author":"Lov\u00e1sz","year":"1986"},{"issue":"1","key":"10.1016\/j.disopt.2026.100955_b6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0166-218X(92)90273-D","article-title":"K\u00f6nig-egerv\u00e1ry graphs, 2-bicritical graphs and fractional matchings","volume":"24","author":"Bourjolly","year":"1989","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.disopt.2026.100955_b7","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.ejc.2010.10.004","article-title":"The critical independence number and an independence decomposition","volume":"32","author":"Larson","year":"2011","journal-title":"European J. Combin."},{"key":"10.1016\/j.disopt.2026.100955_b8","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","article-title":"Vertex packings: structural properties and algorithms","volume":"8","author":"Nemhauser","year":"1975","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.disopt.2026.100955_b9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01593772","article-title":"On the integer-valued variables in the linear vertex packing problem","volume":"12","author":"Picard","year":"1977","journal-title":"Math. Program."},{"issue":"3","key":"10.1016\/j.disopt.2026.100955_b10","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0403037","article-title":"Finding critical independent sets and critical vertex subsets are polynomial problems","volume":"3","author":"Zhang","year":"1990","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"10.1016\/j.disopt.2026.100955_b11","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.orl.2006.07.004","article-title":"Using critical sets to solve the maximum independent set problem","volume":"35","author":"Butenko","year":"2007","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.disopt.2026.100955_b12","first-page":"34","article-title":"A note on critical independence reductions","volume":"51","author":"Larson","year":"2007","journal-title":"Bull. Inst. Combin. Appl."},{"issue":"1","key":"10.1016\/j.disopt.2026.100955_b13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0012-365X(79)90066-9","article-title":"Independence numbers of graphs\u2014an extension of the koenig-egervary theorem","volume":"27","author":"Deming","year":"1979","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.disopt.2026.100955_b14","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0095-8956(79)90085-6","article-title":"A characterization of the graphs in which the transversal number equals the matching number","volume":"27","author":"Sterboul","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disopt.2026.100955_b15","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1090\/dimacs\/069\/05","article-title":"Graffiti.pc: a variant of graffiti","volume":"69","author":"DeLaVina","year":"2005","journal-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci."},{"key":"10.1016\/j.disopt.2026.100955_b16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.26493\/1855-3974.165.b8b","article-title":"A parallel algorithm for computing the critical independence number and related sets","volume":"6","author":"DeLaVina","year":"2013","journal-title":"Ars Math. Contemp."}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000289?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000289?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:56:35Z","timestamp":1778820995000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528626000289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":16,"alternative-id":["S1572528626000289"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100955","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Vertex packing linear programs and critical independent sets","name":"articletitle","label":"Article Title"},{"value":"Discrete Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100955","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"100955"}}