{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T09:07:23Z","timestamp":1723280843884},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,4,22]],"date-time":"2014-04-22T00:00:00Z","timestamp":1398124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s12532-014-0070-2","type":"journal-article","created":{"date-parts":[[2014,4,21]],"date-time":"2014-04-21T11:24:42Z","timestamp":1398079482000},"page":"365-403","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Branch-and-cut for complementarity-constrained optimization"],"prefix":"10.1007","volume":"6","author":[{"suffix":"Jr.","given":"I. R.","family":"de Farias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Kozyreff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,22]]},"reference":[{"key":"70_CR1","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E Balas","year":"1975","unstructured":"Balas, E.: Facets of the knapsack polytope. Math. Progr. 8, 146\u2013164 (1975)","journal-title":"Math. Progr."},{"key":"70_CR2","unstructured":"Beale, E.M.L., Tomlin, J.A.: Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. In: Lawrence, J. (ed.) Proceedings of the Fifth International Conference on Operations Research, pp. 447\u2013454. Tavistock Publications, London (1970)"},{"key":"70_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/inte.18.2.1","volume":"18","author":"J Bean","year":"1988","unstructured":"Bean, J., Noon, C., Ryan, S., Salton, G.: Selecting tenants in a shopping mall. Interfaces 18, 1\u20139 (1988)","journal-title":"Interfaces"},{"key":"70_CR4","volume-title":"The Linear Complementarity Problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, New York (1992)"},{"key":"70_CR5","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.L., Padberg, M.: Solving large-scale zero-one linear programming problems. Oper. Res. 31, 803\u2013834 (1983)","journal-title":"Oper. Res."},{"key":"70_CR6","unstructured":"Danna, E.: Solving optimization problems at google. Talk presented at the 2010 INFORMS national meeting, Austin (2010)"},{"key":"70_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.2307\/1905292","volume":"28","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B.: On the significance of solving linear programming problems with some integer variables. Econometrica 28, 30\u201344 (1960)","journal-title":"Econometrica"},{"key":"70_CR8","unstructured":"de Farias, JR, I.R., Johnson, E.L., Nemhauser, G.L.: Facets of the complementarity Knapsack polytope. Math. Oper. Res. 27, 210\u2013226 (2002)"},{"key":"70_CR9","unstructured":"de Farias, JR, I.R., Kozyreff, E., Gupta, R., Zhao, R.: Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints. Math. Progr. C 5(1), 75\u2013112 (2013)"},{"key":"70_CR10","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","volume":"106","author":"K Dowsland","year":"1998","unstructured":"Dowsland, K.: Nurse scheduling with tabu search and strategic oscillation. Eur. J. Oper. Res. 106, 393\u2013407 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"70_CR11","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z Gu","year":"1998","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Cover inequalities for 0\u20131 linear programs: computation. INFORMS J. Comput. 10, 427\u2013437 (1998)","journal-title":"INFORMS J. Comput."},{"key":"70_CR12","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"PL Hammer","year":"1975","unstructured":"Hammer, P.L., Johnson, E.L., Peled, U.N.: Facets of regular 0\u20131 polytopes. Math. Progr. 8, 179\u2013206 (1975)","journal-title":"Math. Progr."},{"key":"70_CR13","unstructured":"http:\/\/www.hpcc.ttu.edu\/index.php"},{"key":"70_CR14","first-page":"138","volume":"15","author":"T Ibaraki","year":"1972","unstructured":"Ibaraki, T.: Complementary convex programming. J. Oper. Res. Soc. Japan 15, 138\u2013160 (1972)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"70_CR15","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1287\/opre.21.1.353","volume":"21","author":"T Ibaraki","year":"1973","unstructured":"Ibaraki, T.: The use of cuts in complementarity programming. Oper. Res. 21, 353\u2013359 (1973)","journal-title":"Oper. Res."},{"key":"70_CR16","first-page":"59","volume":"21","author":"T Ibaraki","year":"1978","unstructured":"Ibaraki, T., Hasegawa, T., Teranaka, J., Iwasa, K.: The multiple-choice knapsack problem. J. Oper. Res. Soc. Japan 21, 59\u201393 (1978)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"70_CR17","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0316005","volume":"16","author":"RG Jeroslow","year":"1978","unstructured":"Jeroslow, R.G.: Cutting planes for complementarity constraints. SIAM J. Control Optim. 16, 56\u201362 (1978)","journal-title":"SIAM J. Control Optim."},{"key":"70_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01262932","volume":"16","author":"RR Meyer","year":"1975","unstructured":"Meyer, R.R.: Integer and mixed-integer programming models: general properties. J. Optim. Theory Appl. 16, 191\u2013206 (1975)","journal-title":"J. Optim. Theory Appl."},{"key":"70_CR19","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0012-365X(76)90145-X","volume":"16","author":"RR Meyer","year":"1976","unstructured":"Meyer, R.R.: Mixed-integer minimization models for piecewise-linear functions of a single variable. Discrete Math. 16, 163\u2013171 (1976)","journal-title":"Discrete Math."},{"key":"70_CR20","unstructured":"Mitchell, J.E., Pang, J.S., Yu, B.: Obtaining tighter relaxations of mathematical programs with complementarity constraints. J. Glob. Optim. (in press)"},{"key":"70_CR21","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"70_CR22","doi-asserted-by":"crossref","unstructured":"Nguyen, T.T., Tawarmalani, M., Richard, J.P.P.: Convexification techniques for linear complementarity constraints. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) Integer Programming and Combinatorial (IPCO), Lecture Notes in Computer Science, vol. 6655, pp. 336\u2013348. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20807-2_27"},{"key":"70_CR23","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"70_CR24","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/opre.1090.0721","volume":"58","author":"JP Vielma","year":"2010","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.L.: Mixed-integer models for nonseparable piecewise linear optimization: unifying framework and extensions. Oper. Res. 58, 303\u2013315 (2010)","journal-title":"Oper. Res."},{"key":"70_CR25","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","volume":"128","author":"JP Vielma","year":"2011","unstructured":"Vielma, J.P., Nemhauser, G.L.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Progr. 128, 49\u201372 (2011)","journal-title":"Math. Progr."},{"key":"70_CR26","volume-title":"Model Building in Mathematical Programming","author":"HP Williams","year":"1999","unstructured":"Williams, H.P.: Model Building in Mathematical Programming, 4th edn. Wiley, New York (1999)","edition":"4"},{"key":"70_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"LA Wolsey","year":"1975","unstructured":"Wolsey, L.A.: Faces for a linear inequality in 0\u20131 variables. Math. Progr. 8, 165\u2013178 (1975)","journal-title":"Math. Progr."},{"issue":"1\u20132","key":"70_CR28","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10107-012-0517-z","volume":"141","author":"M. Zhao","year":"2013","unstructured":"Zhao, M., de Farias, I.R.: Branch-and-cut for separable piecewise linear optimization: new inequalities and intersection with semi-continuous constraints. Math. Progr. A 141(1\u20132), 217\u2013255 (2013)","journal-title":"Math. Progr. A"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0070-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-014-0070-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0070-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0070-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T02:34:10Z","timestamp":1581993250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-014-0070-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,22]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["70"],"URL":"https:\/\/doi.org\/10.1007\/s12532-014-0070-2","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,22]]},"assertion":[{"value":"13 December 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2014","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}