{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:46Z","timestamp":1740122446633,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,9,2]],"date-time":"2017-09-02T00:00:00Z","timestamp":1504310400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Chinese Natural Science Foundation","award":["11631013"],"award-info":[{"award-number":["11631013"]}]},{"name":"National 973 Program of China","award":["2015CB856002"],"award-info":[{"award-number":["2015CB856002"]}]},{"name":"Chinese Natural Science Foundation","award":["71331001","11331012"],"award-info":[{"award-number":["71331001","11331012"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10898-017-0562-5","type":"journal-article","created":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T20:43:36Z","timestamp":1504298616000},"page":"289-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized coefficient strengthening cuts for mixed integer programming"],"prefix":"10.1007","volume":"70","author":[{"given":"Wei-Kun","family":"Chen","sequence":"first","affiliation":[]},{"given":"Liang","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5222-3287","authenticated-orcid":false,"given":"Mu-Ming","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,2]]},"reference":[{"key":"562_CR1","volume-title":"An Algorithm for the Mixed Integer Problem. RM-2597","author":"R Gomory","year":"1960","unstructured":"Gomory, R.: An Algorithm for the Mixed Integer Problem. RM-2597. The Rand Corporation, Santa Monica (1960)"},{"key":"562_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H Marchand","year":"2001","unstructured":"Marchand, H., Wolsey, L.A.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49, 363\u2013371 (2001)","journal-title":"Oper. Res."},{"key":"562_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/S0167-6377(02)00112-8","volume":"30","author":"AN Letchford","year":"2002","unstructured":"Letchford, A.N., Lodi, A.: Strengthening Chv\u00e1tal\u2013Gomory cuts and Gomory fractional cuts. Oper. Res. Lett. 30, 74\u201382 (2002)","journal-title":"Oper. Res. Lett."},{"key":"562_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00453-008-9218-7","volume":"55","author":"AMCA Koster","year":"2008","unstructured":"Koster, A.M.C.A., Zymolka, A., Kutschka, M.: Algorithms to separate \n                    \n                      \n                    \n                    $$\\{0,\\frac{1}{2}\\}$$\n                    \n                      \n                        \n                          {\n                          0\n                          ,\n                          \n                            1\n                            2\n                          \n                          }\n                        \n                      \n                    \n                  -Chv\u00e1tal\u2013Gomory cuts. Algorithmica 55, 375\u2013391 (2008)","journal-title":"Algorithmica"},{"key":"562_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"KL Hoffman","year":"1991","unstructured":"Hoffman, K.L., Padberg, M.: Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA J. Comput. 3, 121\u2013134 (1991)","journal-title":"ORSA J. Comput."},{"key":"562_CR6","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":"562_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","volume":"121","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk, A., Nemhauser, G.L., Savelsbergh, M.W.P.: Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121, 40\u201355 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"562_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Ann. Discret. Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discret. Math."},{"key":"562_CR9","first-page":"49","volume":"77","author":"R Weismantel","year":"1997","unstructured":"Weismantel, R.: On the 0\/1 knapsack polytope. Math. Program. 77, 49\u201368 (1997)","journal-title":"Math. Program."},{"key":"562_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0167-6377(85)90012-4","volume":"4","author":"TJ Roy Van","year":"1985","unstructured":"Van Roy, T.J., Wolsey, L.A.: Valid inequalities and separation for uncapacitated fixed charge networks. Oper. Res. Lett. 4, 105\u2013112 (1985)","journal-title":"Oper. Res. Lett."},{"key":"562_CR11","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"MW Padberg","year":"1985","unstructured":"Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid linear inequalities for fixed charge problems. Oper. Res. 33, 842\u2013861 (1985)","journal-title":"Oper. Res."},{"key":"562_CR12","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Z Gu","year":"1999","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted flow cover inequalities for mixed 0\u20131 integer programs. Math. Program. 85, 439\u2013467 (1999)","journal-title":"Math. Program."},{"key":"562_CR13","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.: Lifted cover inequalities for 0\u20131 integer programs: computation. INFORMS J. Comput. 10, 427\u2013437 (1998)","journal-title":"INFORMS J. Comput."},{"key":"562_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s12532-010-0015-3","volume":"2","author":"T Achterberg","year":"2010","unstructured":"Achterberg, T., Raack, C.: The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs. Math. Program. Comput. 2, 125\u2013165 (2010)","journal-title":"Math. Program. Comput."},{"key":"562_CR15","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-38189-8_18","volume-title":"Facets of Combinatorial Optimization","author":"T Achterberg","year":"2013","unstructured":"Achterberg, T., Wunderling, R.: Mixed integer programming: analyzing 12 years of progress. In: Jnger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization, pp. 449\u2013481. Springer, Berlin (2013)"},{"key":"562_CR16","unstructured":"IBM CPLEX Optimizer. \n                    http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/index.html"},{"key":"562_CR17","unstructured":"Achterberg, T., Bixby, R.E., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming. ZIB Report 16\u201344, Zuse Institute Berlin, (2016)"},{"key":"562_CR18","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MWP Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6, 445\u2013454 (1994)","journal-title":"ORSA J. Comput."},{"key":"562_CR19","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, Technische Universit\u00e4t, Berlin (2007). \n                    https:\/\/opus4.kobv.de\/opus4-zib\/frontdoor\/index\/index\/docId\/1112"},{"key":"562_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s101070100284","volume":"92","author":"A Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk, A., Rajan, D.: On splittable and unsplittable flow capacitated network design arc-set polyhedra. Math. Program. 92, 315\u2013333 (2002)","journal-title":"Math. Program."},{"key":"562_CR21","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"TL Magnanti","year":"1993","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design problems. Math. Program. 60, 233\u2013250 (1993)","journal-title":"Math. Program."},{"key":"562_CR22","unstructured":"Gamrath, G., Fischer, T., Gally, T., Gleixner, A.M., Hendel, G., Koch, T., Maher, S.J., Miltenberger, M., M\u00fcller, B., Pfetsch, M.E., Puchert, C.: The SCIP optimization suite 3.2. ZIB Report 15\u201360, Zuse Institute Berlin, (2016)"},{"key":"562_CR23","first-page":"12","volume":"54","author":"R Bixby","year":"1998","unstructured":"Bixby, R., Ceria, S., McZeal, C., Savelsbergh, M.: An updated mixed integer programming library: MIPLIB 3.0. Optima 54, 12\u201315 (1998)","journal-title":"Optima"},{"key":"562_CR24","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34, 361\u2013372 (2006)","journal-title":"Oper. Res. Lett."},{"key":"562_CR25","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3, 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"562_CR26","unstructured":"Wunderling, R.: Paralleler und objektorientierter simplex. Ph.D. thesis, Technische Universit\u00e4t Berlin, (1996). \n                    https:\/\/opus4.kobv.de\/opus4-zib\/frontdoor\/index\/index\/docId\/538"},{"key":"562_CR27","unstructured":"Wolter, K.: Implementation of cutting plane separators for mixed integer programs. Master\u2019s thesis, Technische Universit\u00e4t Berlin, (2006)"},{"key":"562_CR28","unstructured":"Beate, B., G\u00fcnl\u00fck, O., Wolsey, L.A.: Designing private line networks: polyhedral analysis and computation. CORE Discussion Paper 9647, Universit\u00e9 Catholique de Louvain, (1996)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0562-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0562-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0562-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T16:30:57Z","timestamp":1552667457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0562-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,2]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["562"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0562-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2017,9,2]]},"assertion":[{"value":"8 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}