{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T12:09:05Z","timestamp":1680437345853},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":[[1992,4]]},"DOI":"10.1007\/bf01581198","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:55:11Z","timestamp":1114667711000},"page":"183-191","source":"Crossref","is-referenced-by-count":11,"title":["Tight integral duality gap in the Chinese Postman problem"],"prefix":"10.1007","volume":"55","author":[{"given":"Ephraim","family":"Korach","sequence":"first","affiliation":[]},{"given":"Michal","family":"Penn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"J.A. Bondy and U.S.R. Murty,Graph Theory with Applications (Elsevier, New York, 1976)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0121194","volume":"8","author":"W.H. Cunningham","year":"1978","unstructured":"W.H. Cunningham and A.B. Marsh III, \u201cA primal algorithm for optimum matching,\u201dMathematical Programming Study 8 (1978) 50\u201372.","journal-title":"Mathematical Programming Study"},{"key":"CR3","first-page":"89","volume-title":"Combinatorial Structures and Their Applications","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, H. Hanani, N. Sauer and J. Schonheim, eds.,Combinatorial Structures and Their Applications (Gordon and Breach, New York, 1970) pp. 89\u201392."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds and E.L. Johnson, \u201cMatching, Euler tours and the Chinese Postman,\u201dMathematical Programming 5 (1973) 88\u2013129.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"S. Even, A. Itai and A. Shamir, \u201cOn the complexity of time table and multicommodity flow problems,\u201dSIAM Journal on Computing 5 (1976) 691\u2013703.","journal-title":"SIAM Journal on Computing"},{"key":"CR6","first-page":"303","volume-title":"Mathematics of the Decision Sciences, Part I","author":"D.R. Fulkerson","year":"1968","unstructured":"D.R. Fulkerson, \u201cNetworks, frames and blocking systems,\u201d in: G.B. Dantzig and A.F. Veinott, eds.,Mathematics of the Decision Sciences, Part I (American Mathematical Society, Providence, RI 1968) pp. 303\u2013334."},{"key":"CR7","volume-title":"Packing ofT-cuts, and other aspects of dual integrality","author":"E. Korach","year":"1982","unstructured":"E. Korach, \u201cPacking ofT-cuts, and other aspects of dual integrality,\u201d Ph.D. thesis, Department of Combinatorics and Optimization, University of Waterloo (Waterloo, Ont., 1982)."},{"key":"CR8","volume-title":"\u201cTight integral duality gap in the Chinese Postman problem,\u201d Technical Report No. 360","author":"E. Korach","year":"1985","unstructured":"E. Korach and M. Penn, \u201cTight integral duality gap in the Chinese Postman problem,\u201d Technical Report No. 360, Computer Science Department, Technion \u2014 Israel Institute of Technology (Haifa, Israel, 1985)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF01902352","volume":"26","author":"L. Lov\u00e1sz","year":"1975","unstructured":"L. Lov\u00e1sz, \u201c2-mathings and 2-covers of hypergraphs,\u201dActa Mathematica, Academiae Scientiarem Hungaricae 26 (1975) 433\u2013444.","journal-title":"Acta Mathematica, Academiae Scientiarem Hungaricae"},{"key":"CR10","volume-title":"\u201cOn the complexity of the disjoint path problem,\u201d Report No. 89585-OR","author":"M. Middendorf","year":"1989","unstructured":"M. Middendorf and F. Pfeiffer, \u201cOn the complexity of the disjoint path problem,\u201d Report No. 89585-OR, Institut f\u00fcr Operations Research, Universit\u00e4t Bonn (Bonn, 1989)."},{"key":"CR11","volume-title":"On integral duality gap in the Chinese Postman problem, plane multi-commodity flow and weakly bipartite graphs","author":"M. Penn","year":"1987","unstructured":"M. Penn, \u201cOn integral duality gap in the Chinese Postman problem, plane multi-commodity flow and weakly bipartite graphs,\u201d D.Sc. thesis, Department of Industrial and Management Engineering, Technion \u2014 Israel Institute of Technology (Haifa, Israel, 1987). [In Hebrew.]"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0095-8956(90)90062-5","volume":"49","author":"A. Seb\u00f6","year":"1990","unstructured":"A. Seb\u00f6, \u201cOn the structure of odd-joins,\u201dJournal of Combinatorial Theory, Series B 49 (1990) 10\u201339.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(77)90031-4","volume":"23","author":"P.D. Seymour","year":"1977","unstructured":"P.D. Seymour, \u201cThe matroids with the max-flow min-cut property,\u201dJournal of Combinatorial Theory, Series B 23 (1977) 189\u2013222.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0195-6698(81)80033-9","volume":"2","author":"P.D. Seymour","year":"1981","unstructured":"P.D. Seymour, \u201cMatroids and multicommodity flows,\u201dEuropean Journal of Combinatorics 2 (1981) 257\u2013290.","journal-title":"European Journal of Combinatorics"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1112\/plms\/s3-42.1.178","volume":"42","author":"P.D. Seymour","year":"1981","unstructured":"P.D. Seymour, \u201cOn odd cuts and plane multicommodity flows,\u201d in:Proceedings of the London Mathematical Society (3) 42 (1981) 178\u2013192.","journal-title":"Proceedings of the London Mathematical Society (3)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581198.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581198\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:16Z","timestamp":1556881936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["BF01581198"],"URL":"https:\/\/doi.org\/10.1007\/bf01581198","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}