{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T00:09:48Z","timestamp":1778285388029,"version":"3.51.4"},"reference-count":40,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0377-2217(02)00071-1","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:56:01Z","timestamp":1034610961000},"page":"291-321","source":"Crossref","is-referenced-by-count":55,"title":["Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations"],"prefix":"10.1016","volume":"140","author":[{"given":"Dorit S.","family":"Hochbaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00071-1_BIB1","unstructured":"Ahuja, R.K., Hochbaum, D.S., Orlin, J.B., 1999a. A cut based algorithm for the convex dual of the minimum cost network flow problem. Manuscript, UC Berkeley"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB2","series-title":"IPCO99 Proceedings","first-page":"31","article-title":"Solving a convex dual of minimum cost flow","volume":"vol. 1610","author":"Ahuja","year":"1999"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB3","series-title":"Proceeding of the 5th United States Postal service Advanced Technology Conference","first-page":"1169","article-title":"Locating competitive new facilities in the presence of existing facilities","author":"Ball","year":"1992"},{"issue":"5","key":"10.1016\/S0377-2217(02)00071-1_BIB4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0167-6377(99)00056-5","article-title":"A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine","volume":"25","author":"Chudak","year":"1999","journal-title":"Operations Research Letters"},{"issue":"2","key":"10.1016\/S0377-2217(02)00071-1_BIB5","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","article-title":"A strongly polynomial algorithm to solve combinatorial linear programs","volume":"34","author":"Tardos","year":"1986","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(02)00071-1_BIB6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","article-title":"A fast parametric maximum flow algorithm and applications","volume":"18","author":"Gallo","year":"1989","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02523685","article-title":"Primal\u2013dual approximation algorithms for integral flow and multicut in trees","volume":"18","author":"Garg","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB8","series-title":"Proceedings of the 21th International Colloquium on Automata, Languages and Programming","first-page":"487","article-title":"Multiway cuts in directed and node weighted graphs","author":"Garg","year":"1994"},{"issue":"2","key":"10.1016\/S0377-2217(02)00071-1_BIB9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1137\/S0097539793243016","article-title":"Approximate max-flow min-(multi)cut theorems and their applications","volume":"25","author":"Garg","year":"1996","journal-title":"SIAM Journal of Computing"},{"issue":"6","key":"10.1016\/S0377-2217(02)00071-1_BIB10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"Journal of the ACM"},{"issue":"2","key":"10.1016\/S0377-2217(02)00071-1_BIB11","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/moor.16.2.351","article-title":"Combinatorial algorithms for the generalized circulation problem","volume":"16","author":"Goldberg","year":"1991","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB12","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum flow problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB13","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1287\/moor.15.3.430","article-title":"Solving minimum cost flow problem by successive approximation","volume":"15","author":"Goldberg","year":"1990","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB14","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1006\/jagm.1994.1043","article-title":"A faster algorithm for finding the minimum cut in a graph","volume":"17","author":"Hao","year":"1994","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB15","series-title":"Proceedings of 37th IEEE Symposium on Foundations of Computer Science","first-page":"627","article-title":"Clique is hard to approximate within n1\u2212\u03f5","author":"H\u00e5stad","year":"1996"},{"issue":"4","key":"10.1016\/S0377-2217(02)00071-1_BIB16","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","article-title":"Some optimal inapproximability results","volume":"48","author":"H\u00e5stad","year":"2001","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB17","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01585160","article-title":"Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality","volume":"62","author":"Hochbaum","year":"1993","journal-title":"Mathematical Programming"},{"issue":"6","key":"10.1016\/S0377-2217(02)00071-1_BIB18","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1137\/S0097539793251876","article-title":"Simple and fast algorithms for linear and integer programs with two variables per inequality","volume":"23","author":"Hochbaum","year":"1994","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"10.1016\/S0377-2217(02)00071-1_BIB19","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1093\/forestscience\/43.4.544","article-title":"Forest harvesting and minimum cuts","volume":"43","author":"Hochbaum","year":"1997","journal-title":"Forest Science"},{"issue":"1\u20133","key":"10.1016\/S0377-2217(02)00071-1_BIB20","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0166-218X(00)00244-4","article-title":"Approximating a generalization of MAX 2SAT and MIN 2SAT","volume":"107","author":"Hochbaum","year":"2000","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB21","series-title":"Proceedings of the 8th Annual European Symposium on Algorithms \u2013 ESA 2000","first-page":"256","article-title":"Minimizing a convex cost closure set","volume":"vol. 1879","author":"Hochbaum","year":"2000"},{"issue":"3","key":"10.1016\/S0377-2217(02)00071-1_BIB22","doi-asserted-by":"crossref","DOI":"10.1137\/0211045","article-title":"Approximation algorithms for the set covering and vertex cover problems","volume":"11","author":"Hochbaum","year":"1982","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB23","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(83)90080-X","article-title":"Efficient bounds for the stable set, vertex cover and set packing problems","volume":"6","author":"Hochbaum","year":"1983","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"10.1016\/S0377-2217(02)00071-1_BIB24","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/moor.19.2.390","article-title":"Lower and upper bounds for allocation problems","volume":"19","author":"Hochbaum","year":"1994","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB25","series-title":"Approximation Algorithms for NP-hard Problems","article-title":"Approximating covering and packing problems: Set cover, vertex cover, independent set and related problems","author":"Hochbaum","year":"1997"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB26","series-title":"Approximation Algorithms for NP-hard Problems","article-title":"Various notions of approximations: Good, better, best and more","author":"Hochbaum","year":"1997"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB27","unstructured":"Hochbaum, D.S., 1997. The pseudo flow algorithm for the maximum flow problem. Manuscript, UC Berkeley"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB28","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/jagm.1998.0964","article-title":"Approximating clique and biclique problems","volume":"29","author":"Hochbaum","year":"1998","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB29","series-title":"APPROX98","first-page":"111","article-title":"The t-vertex cover problem: Extending the half integrality framework with budget constraints","volume":"vol. 1444","author":"Hochbaum","year":"1998"},{"issue":"4","key":"10.1016\/S0377-2217(02)00071-1_BIB30","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1145\/502090.502093","article-title":"An efficient algorithm for image segmentation, Markov Random Fields and related problems","volume":"48","author":"Hochbaum","year":"2001","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB31","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01200755","article-title":"An approximate max-flow min-cut relation for undirected multicommodity flow, with applications","volume":"15","author":"Klein","year":"1995","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/S0377-2217(02)00071-1_BIB32","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/S0895480191220836","article-title":"The minimum satisfiability problem","volume":"7","author":"Kohli","year":"1994","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB33","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0214016","article-title":"The computational complexity of simultaneous diophantine approximation problems","volume":"14","author":"Lagarias","year":"1985","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB34","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"issue":"1","key":"10.1016\/S0377-2217(02)00071-1_BIB35","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(96)00031-2","article-title":"On approximation algorithms for the minimum satisfiability problem","volume":"58","author":"Marathe","year":"1996","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB36","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/opre.41.2.338","article-title":"A faster strongly polynomial minimum cost flow algorithm","volume":"41","author":"Orlin","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB37","first-page":"1272","article-title":"Maximal closure of a graph and applications to combinatorial problems","author":"Picard","year":"1976","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB38","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/77600.77620","article-title":"The maximum concurrent flow problem","volume":"37","author":"Shahrokhi","year":"1990","journal-title":"Journal of the Association of Computing Machinery"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB39","series-title":"Proceedings of Algorithms \u2013 ESA'95","first-page":"394","article-title":"Approximation algorithms for feasible cut and multicut problems","volume":"vol. 979","author":"Yu","year":"1995"},{"key":"10.1016\/S0377-2217(02)00071-1_BIB40","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0210021","article-title":"Edge deletion problems","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM Journal of Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702000711?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702000711?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T10:59:45Z","timestamp":1733223585000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702000711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0377221702000711"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00071-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}