{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T17:53:32Z","timestamp":1712858012330},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,2]],"date-time":"2006-12-02T00:00:00Z","timestamp":1165017600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,2,6]]},"DOI":"10.1007\/s10479-006-0112-x","type":"journal-article","created":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T18:29:06Z","timestamp":1164997746000},"page":"81-87","source":"Crossref","is-referenced-by-count":9,"title":["Branch and bound, integer, and non-integer programming"],"prefix":"10.1007","volume":"149","author":[{"given":"J. J. H.","family":"Forrest","sequence":"first","affiliation":[]},{"given":"J. A.","family":"Tomlin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,12,2]]},"reference":[{"key":"112_CR1","unstructured":"Beale, E.M.L. (1963). \u201cTwo Transportation Problems.\u201d In G. Kreweras and G. Morlat (Eds.), Proceedings of the Third International Conference on Operational Research, pp. 780\u2013788. Dunod, Paris and English Universities Press, London."},{"key":"112_CR2","volume-title":"Mathematical Programming in Practice","author":"E.M.L. Beale","year":"1968","unstructured":"Beale, E.M.L. (1968). Mathematical Programming in Practice. London: Pitman\u2019s, and New York: Wiley."},{"key":"112_CR3","unstructured":"Beale, E.M.L. (1970). \u201cAdvanced Algorithmic Features for General Mathematical Programming Systems\u201d. In J. Abadie (Ed.), Integer and Nonlinear Programming, pp. 119\u2013137. Amsterdam: North Holland."},{"key":"112_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0167-5060(08)70351-0","volume":"5","author":"E.M.L. Beale","year":"1979","unstructured":"Beale, E.M.L. (1979). \u201cBranch and Bound Methods for Mathematical Programming Systems.\u201d Annals of Discrete Mathematics, 5, 201\u2013219.","journal-title":"Annals of Discrete Mathematics"},{"key":"112_CR5","unstructured":"Beale, E.M.L. (1980). \u201cBranch and Bound Methods for Numerical Optimization of Non-convex Functions.\u201d In M.M. Barritt and D. Wishart (Eds.), COMPSTAT 80 Proceedings in Computational Statistics, pp. 11\u201320."},{"key":"112_CR6","doi-asserted-by":"crossref","unstructured":"Beale, E.M.L. (1985). \u201cInteger Programming.\u201d In K. Schittkowski (Ed.), Computational Mathematical Programming. NATO ASI Series F: Computer and System Sciences, Vol. 15. pp. 1\u201324 Berlin: Springer-Verlag.","DOI":"10.1007\/978-3-642-82450-0_1"},{"key":"112_CR7","unstructured":"Beale, E.M.L. and R.C. Daniel. (1979). \u201cChains of Linked Ordered Sets: A New Formulation for Product Terms.\u201d Presented at the 10th International Symposium on Mathematical Programming, Montreal."},{"key":"112_CR8","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BF01580653","volume":"10","author":"E.M.L. Beale","year":"1976","unstructured":"Beale, E.M.L. and J.J.H. Forrest. (1976). \u201cGlobal Optimization using Special Ordered Sets.\u201d Mathematical Programming, 10, 52\u201369.","journal-title":"Mathematical Programming"},{"key":"112_CR9","unstructured":"Beale, E.M.L. and J.J.H. Forrest. (1978). \u201cGlobal Optimization as an Extension of Integer Programming.\u201d In L.C.W. Dixon and G.P. Szego (Eds.), Towards Global Optimization 2, pp. 131\u2013149. Amsterdam: North Holland."},{"key":"112_CR10","unstructured":"Beale, E.M.L. and R.E. Small. (1965). \u201cMixed Integer Programming by a Branch and Bound Technique.\u201d In W.A. Kalenich (Ed.), Proceedings of the IFIP Congress 1965, pp. 450\u2013451. London: MacMillan and Washington, DC: Spartan Press."},{"key":"112_CR11","unstructured":"Beale, E.M.L. and J.A. Tomlin. (1970). \u201cSpecial Facilities in a General Mathematical Programming System for Non-convex Problems using Ordered Sets of Variables.\u201d In J. Lawrence (Ed.), Proceedings of the Fifth International Conference on Operational Research, pp. 447\u2013454. London: Tavistock Publications."},{"key":"112_CR12","doi-asserted-by":"crossref","unstructured":"Benichou, M., J.M. Gauthier, G. Hentges, and G. Ribi\u00e8re. (1977). \u201cThe Efficient Solution of Large-scale Linear Programming Problems \u2014 Some Algorithmic Techniques and Computational Results.\u201d Mathematical Programming, 13, 280\u2013322.","DOI":"10.1007\/BF01584344"},{"key":"112_CR13","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton, NJ: Princeton University Press."},{"key":"112_CR14","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/mnsc.12.7.576","volume":"12","author":"N.J. Driebeck","year":"1966","unstructured":"Driebeck, N.J. (1966). \u201cAn Algorithm for the Solution of Mixed Integer Programming Problems.\u201d Management Science, 12, 576\u2013587.","journal-title":"Management Science"},{"key":"112_CR15","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.20.5.736","volume":"20","author":"J.J.H. Forrest","year":"1974","unstructured":"Forrest, J.J.H., J.P.H. Hirst, and J.A. Tomlin. (1974). \u201cPractical Solution of Large Mixed Integer Programming Problems with UMPIRE.\u201d Management Science, 20, 736\u2013773.","journal-title":"Management Science"},{"key":"112_CR16","unstructured":"Gomory, R.E. (1963). \u201cAn Algorithm for Integer Solutions to Linear Programs.\u201d In R.L. Graves and P. Wolfe (Eds.), Recent Advances in Mathematical Programming, pp. 269\u2013302. New York: McGraw-Hill."},{"key":"112_CR17","unstructured":"Gomory, R.E. (1991). \u201cEarly Integer Programming.\u201d In J.K. Lenstra, et al. (Eds.), History of Mathematical Programming, pp. 55\u201361. Amsterdam: North Holland."},{"key":"112_CR18","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A.H. Land","year":"1960","unstructured":"Land, A.H. and A.G. Doig. (1960). \u201cAn Automatic Method for Solving Discrete Programming Problems.\u201d Econometrica, 28, 497\u2013520.","journal-title":"Econometrica"},{"key":"112_CR19","doi-asserted-by":"crossref","first-page":"84","DOI":"10.2307\/1907744","volume":"25","author":"H.M. Markowitz","year":"1957","unstructured":"Markowitz, H.M. and A.S. Manne. (1957). \u201cOn the Solution of Discrete Programming Problems.\u201d Econometrica, 25, 84\u2013110.","journal-title":"Econometrica"},{"key":"112_CR20","unstructured":"Martin, G.T. (1963). \u201cAn Accelerated Euclidean Algorithm for Integer Linear Programming.\u201d In R.L. Graves and P. Wolfe (Eds.), Recent Advances in Mathematical Programming, pp. 311\u2013317. New York: McGraw-Hill."},{"key":"112_CR21","unstructured":"Shaw, M. (1969). \u201cReview of Computational Experience in Solving Large Mixed Integer Programming Problems.\u201d In E.M.L. Beale (Ed.), Applications of Mathematical Programming Techniques, pp. 406\u2013412. London: English Universities Press."},{"key":"112_CR22","unstructured":"Tomlin, J.A. (1970). \u201cBranch and Bound Methods for Integer and Non-convex Programming.\u201d In J. Abadie (Ed.), Integer and Nonlinear Programming, pp. 437\u2013450. Amsterdam: North Holland."},{"key":"112_CR23","doi-asserted-by":"crossref","unstructured":"Tomlin, J.A. (1981). \u201cA Suggested Extension of Special Ordered Sets to Non-separable Non-convex Programming Problems.\u201d In P. Hansen (Ed.), Studies on Graphs and Discrete Programming, pp. 359\u2013370. Amsterdam: North Holland.","DOI":"10.1016\/S0304-0208(08)73476-5"},{"key":"112_CR24","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01589393","volume":"42","author":"J.A. Tomlin","year":"1988","unstructured":"Tomlin, J.A. (1988). \u201cSpecial Ordered Sets and An Application to Gas Supply Operations Planning.\u201d Mathematical Programming, 42, 69\u201384.","journal-title":"Mathematical Programming"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0112-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-006-0112-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0112-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:35Z","timestamp":1559153255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-006-0112-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,2]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2,6]]}},"alternative-id":["112"],"URL":"https:\/\/doi.org\/10.1007\/s10479-006-0112-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,2]]}}}