{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:45Z","timestamp":1763467485526},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1016\/s0167-6377(97)00032-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:03:44Z","timestamp":1027641824000},"page":"123-132","source":"Crossref","is-referenced-by-count":17,"title":["The parsimonious property of cut covering problems and its applications"],"prefix":"10.1016","volume":"21","author":[{"given":"Dimitris","family":"Bertsimas","sequence":"first","affiliation":[]},{"given":"Chungpiaw","family":"Teo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(97)00032-1_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with (0,1)-vertices","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/S0167-6377(97)00032-1_BIB2","series-title":"Paths, Flows and VLSI-Layout","first-page":"47","article-title":"Packing paths, circuits and cuts \u2014 a survey","author":"Frank","year":"1990"},{"key":"10.1016\/S0167-6377(97)00032-1_BIB3","unstructured":"M.X. Goemans, A note on the parsimonious property, unpublished manuscript."},{"key":"10.1016\/S0167-6377(97)00032-1_BIB4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01580607","article-title":"Survivable networks, linear programming relaxations and the parsimonius property","volume":"60","author":"Goemans","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(97)00032-1_BIB5","series-title":"Proc. 5th ACM SIAM Symp. of Discrete Algorithms","article-title":"Improved approximation algorithms for network design problems","author":"Goemans","year":"1993"},{"key":"10.1016\/S0167-6377(97)00032-1_BIB6","series-title":"Proc. 3rd ACM-SIAM Symp. Discrete Algorithms","first-page":"307","article-title":"A general approximation technique for constrained forest problems","author":"Goemans","year":"1992"},{"key":"10.1016\/S0167-6377(97)00032-1_BIB7","first-page":"235","article-title":"On cut-set integer polyhedra","volume":"17","author":"Johnson","year":"1975","journal-title":"Cashiers Centre E\u0142udes Rech. Oper."},{"key":"10.1016\/S0167-6377(97)00032-1_BIB8","first-page":"4","article-title":"Multiflow feasibility depending on cuts","volume":"9","author":"Lomosonov","year":"1979","journal-title":"Graph Theory Newsletter"},{"key":"10.1016\/S0167-6377(97)00032-1_BIB9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01902503","article-title":"On some connectivity properties of Eulerian graphs","volume":"28","author":"Lov\u00e1sz","year":"1976","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/S0167-6377(97)00032-1_BIB10","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/S0167-6377(97)00032-1_BIB11","first-page":"559","article-title":"On the convex polyhedra of the symmetric travelling salesman problem","volume":"61","author":"Norman","year":"1955","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0167-6377(97)00032-1_BIB12","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1287\/opre.14.6.1121","article-title":"Feasibility of two-commodity network flows","volume":"14","author":"Rothschild","year":"1966","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(97)00032-1_BIB13","series-title":"Theory of Integer and Linear Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0167-6377(97)00032-1_BIB14","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0095-8956(91)90052-L","article-title":"Short proofs on multicommodity flows and cuts","volume":"53","author":"Schrijver","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0167-6377(97)00032-1_BIB15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/net.3230100108","article-title":"Four-terminal flows","volume":"10","author":"Seymour","year":"1980","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(97)00032-1_BIB16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0020-0190(90)90028-V","article-title":"Analyzing the Held-Karp TSP bound: a monotonicity property with application","volume":"35","author":"Shmoys","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0167-6377(97)00032-1_BIB17","series-title":"Proc. 25th Ann. ACM Symp. on Theory of Computing","first-page":"708","article-title":"A primal-dual approximation algorithm for generalized Steiner network problems","author":"Williamson","year":"1993"},{"key":"10.1016\/S0167-6377(97)00032-1_BIB18","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BFb0120913","article-title":"Heuristic analysis, linear programming and Branch and bound","volume":"13","author":"Wolsey","year":"1980","journal-title":"Math. Prog. Study"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000321?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000321?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T09:55:52Z","timestamp":1555494952000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637797000321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0167637797000321"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(97)00032-1","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}