{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:02:21Z","timestamp":1761894141241},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1972,2,1]],"date-time":"1972-02-01T00:00:00Z","timestamp":65750400000},"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":[[1972,2]]},"DOI":"10.1007\/bf01584553","type":"journal-article","created":{"date-parts":[[2005,6,27]],"date-time":"2005-06-27T17:42:40Z","timestamp":1119894160000},"page":"330-382","source":"Crossref","is-referenced-by-count":41,"title":["Integer programming and convex analysis: Intersection cuts from outer polars"],"prefix":"10.1007","volume":"2","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01584553_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"E. Balas, \u201cIntersection cuts \u2014 a new type of cutting planes for integer programming,\u201d Management Sciences Research Report No. 187, October 1969,Operations Research 19 (1971) 19\u201339.","journal-title":"Operations Research"},{"key":"BF01584553_CR2","unstructured":"E. Balas, \u201cAlternative strategies for using intersection cuts in integer programming,\u201d Management Sciences Research Report No. 209, Carnegie\u2014Mellon University, June 1970."},{"key":"BF01584553_CR3","unstructured":"E. Balas, \u201cInteger programming and convex analysis,\u201d Management Sciences Research Report No. 246, Carnegie\u2014Mellon University, April 1971."},{"key":"BF01584553_CR4","unstructured":"E. Balas, \u201cA note on the asymptotic theory of integer programming and the 0\u20131 case,\u201d Management Sciences Research Report No. 249, Carnegie\u2014Mellon University, May 1971."},{"issue":"1","key":"BF01584553_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(72)90056-8","volume":"2","author":"E. Balas","year":"1972","unstructured":"E. Balas, \u201cRanking the facets of the octahedron,\u201d Management Sciences Research Report No. 252, Carnegie\u2014Mellon University, May 1971.Discrete Mathematics 2, No.1 (1972) 1\u201315.","journal-title":"Discrete Mathematics"},{"key":"BF01584553_CR6","unstructured":"E. Balas, \u201cImplicit enumeration with intersection cuts from outer polars,\u201d NATO Conference on the Application of Optimization Methods to Large-Scale Systems.\u201d Elsinore (Denmark), July 5\u20139, 1971."},{"key":"BF01584553_CR7","unstructured":"E. Balas and C. Burdet, \u201cOn concave quadratic programming,\u201d in preparation."},{"key":"BF01584553_CR8","doi-asserted-by":"crossref","unstructured":"E. Balas and R. Jeroslow, \u201cCanonical cuts on the unit hypercube,\u201d Management Sciences Research Report No. 198. Carnegie\u2014Mellon University, Aug.\u2013Dec. 1969.SIAM Journal on Applied Mathematics 23 (1972) No. 1.","DOI":"10.1137\/0123007"},{"issue":"1","key":"BF01584553_CR9","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1287\/opre.19.1.40","volume":"19","author":"E. Balas","year":"1971","unstructured":"E. Balas, V.J. Bowman, F. Glover and D. Sommer, \u201cAn intersection cut from the dual of the unit hypercube,\u201dOperations Research 19, No. 1 (1971) 40\u201344.","journal-title":"Operations Research"},{"key":"BF01584553_CR10","unstructured":"C. Burdet, \u201cA class of cuts and related algorithms in integer programming,\u201d Management Sciences Research Report No. 220, Carnegie\u2014Mellon University, September 1970."},{"key":"BF01584553_CR11","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BF01584536","volume":"2","author":"C. Burdet","year":"1972","unstructured":"C. Burdet, \u201cEnumerative inequalities in integer programming,\u201dMathematical Programming 2 (1972) 32\u201364.","journal-title":"Mathematical Programming"},{"key":"BF01584553_CR12","volume-title":"Convexity cuts","author":"F. Glover","year":"1969","unstructured":"F. Glover, \u201cConvexity cuts,\u201d University of Texas, Austin, December 1969."},{"key":"BF01584553_CR13","unstructured":"F. Glover, \u201cCut-search methods in integer programming,\u201d University of Colorado, September 1970."},{"key":"BF01584553_CR14","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1073\/pnas.53.2.260","volume":"53","author":"R. Gomory","year":"1965","unstructured":"R. Gomory, \u201cOn the relation between integer and noninteger solutions to linear programs,\u201dProceedings of the National Academy of Sciences 53 (1965) 260\u2013265.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"BF01584553_CR15","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R. Gomory","year":"1969","unstructured":"R. Gomory, \u201cSome polyhedra connected with combinatorial problems,\u201dLinear Algebra and its Applications 2 (1969) 451\u2013558.","journal-title":"Linear Algebra and its Applications"},{"key":"BF01584553_CR16","volume-title":"Convex polytopes","author":"B. Grunbaum","year":"1967","unstructured":"B. Grunbaum,Convex polytopes (Wiley, New York, 1967)."},{"key":"BF01584553_CR17","unstructured":"Hoang Tuy, \u201cConcave programming under linear constraints,\u201dDoklady Akademii Nauk SSSR (1964) (in Russian); English translation:Soviet Mathematics (1964) 1437\u20131440."},{"key":"BF01584553_CR18","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.17.4.680","volume":"17","author":"M. Raghavachari","year":"1969","unstructured":"M. Raghavachari, \u201cOn the zero\u2013one integer programming problem,\u201d Technical Report No. 20, Department of Statistics, Carnegie\u2014Mellon University, July 1968,Operations Research 17 (1969) 680\u2013684.","journal-title":"Operations Research"},{"key":"BF01584553_CR19","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, 1970)."},{"key":"BF01584553_CR20","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/opre.16.1.103","volume":"16","author":"J. Shapiro","year":"1968","unstructured":"J. Shapiro, \u201cDynamic programming algorithms for the integer programming problem I. The integer programming problem viewed as a Knapsack problem,\u201dOperations Research 16 (1968) 103\u2013121.","journal-title":"Operations Research"},{"key":"BF01584553_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-46216-0","volume-title":"Convexity and optimization in finite dimensions I","author":"J. Stoer","year":"1970","unstructured":"J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions I. (Springer, Heidelberg, 1970)."},{"issue":"6","key":"BF01584553_CR22","first-page":"51","volume":"23","author":"A.D. Yoffe","year":"1968","unstructured":"A.D. Yoffe and V.M. Tikhomirov, \u201cDuality of convex functions and extremum problems,\u201dUspekhi Matematicheskih Nauk 23, No. 6 (1968) 51\u2013116; English translation:Russian Mathematical Surveys (1968) 53\u2013124.","journal-title":"Uspekhi Matematicheskih Nauk"},{"key":"BF01584553_CR23","unstructured":"R.D. Young, \u201cNew cuts for a special class of 0\u20131 integer programs,\u201d Rice University, October 1968."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584553.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01584553\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T23:20:48Z","timestamp":1586301648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01584553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1972,2]]}},"alternative-id":["BF01584553"],"URL":"https:\/\/doi.org\/10.1007\/bf01584553","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,2]]}}}