{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:42Z","timestamp":1750694682166},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1988,5]]},"DOI":"10.1007\/bf01580775","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:52:50Z","timestamp":1114681970000},"page":"375-384","source":"Crossref","is-referenced-by-count":4,"title":["An extension of the k\u00f6nig-egerv\u00e1ry property to node-weighted bidirected graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Jean-Marie","family":"Bourjolly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"B. Aspvall, M.F. Plass and R.E. Tarjan, \u201cA linear-time algorithm for testing the truth of certain quantitative Boolean formulas,\u201dInformation Processing Letters 8 (1979) 121\u2013123.","journal-title":"Information Processing Letters"},{"key":"CR2","unstructured":"J.-M. Bourjolly, \u201cIntegral and fractional node-packing, and pseudo-Boolean programming,\u201d Ph.D. Thesis, University of Waterloo, 1986."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BFb0121007","volume":"22","author":"J.-M. Bourjolly","year":"1984","unstructured":"J.-M. Bourjolly, P.L. Hammer and B. Simeone, \u201cNode-weighted graphs having the K\u00f6nig-Egerv\u00e1ry property,\u201dMathematical Programming Study 22 (1984) 44\u201363.","journal-title":"Mathematical Programming Study"},{"key":"CR4","volume-title":"Combinatorial Structures and their Applciations","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds and E.L. Johnson, \u201cMatching: A well-solved class of integer linear programs,\u201d in: R. Guy et al., eds.,Combinatorial Structures and their Applciations (Gordon and Breach, New York, 1970; Proceedings of the Calgary Symposium, June 1969)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R.M. Karp, \u201cTheoretical improvements in algorithmic efficiency for network flow problems,\u201dJournal of the Association for Computing Machinery 19 (1972) 248\u2013264.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR6","unstructured":"J. Green-Kr\u00f3tki, \u201cMatching polyhedra,\u201d M.Sc. Thesis, Carleton University, 1980."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02612354","volume":"28","author":"P.L. Hammer","year":"1984","unstructured":"P.L. Hammer, P. Hansen and B. Simeone, \u201cRoof duality, complementation and persistency in quadratic 0\u20131 optimization,\u201dMathematical Programming 28 (1984) 121\u2013155.","journal-title":"Mathematical Programming"},{"key":"CR8","first-page":"149","volume":"16","author":"Y. Ikura","year":"1982","unstructured":"Y. Ikura and G.L. Nemhauser, \u201cAn efficient primal simplex algorithm for maximum weighted vertex packing on bipartite graphs,\u201dAnnals of Discrete Mathematics 16 (1982) 149\u2013168.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR9","unstructured":"J.L. Kennington and R.V. Helgason,Algorithms for Network Programming (Wiley, 1980)."},{"key":"CR10","unstructured":"A.B. Marsh, III, \u201cMatching algorithms,\u201d Ph.D. Thesis, The Johns Hopkins University, 1979."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580775.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580775\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580775","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:11Z","timestamp":1556896331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["BF01580775"],"URL":"https:\/\/doi.org\/10.1007\/bf01580775","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}