{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T14:54:32Z","timestamp":1674917672525},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,10,30]],"date-time":"2015-10-30T00:00:00Z","timestamp":1446163200000},"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. Program."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10107-015-0959-1","type":"journal-article","created":{"date-parts":[[2015,10,30]],"date-time":"2015-10-30T07:31:37Z","timestamp":1446190297000},"page":"571-583","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets"],"prefix":"10.1007","volume":"159","author":[{"given":"Sujeevraja","family":"Sanjeevi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sina","family":"Masihabadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiavash","family":"Kianfar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,30]]},"reference":[{"issue":"1\u20132","key":"959_CR1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10107-010-0382-6","volume":"132","author":"A Atamt\u00fcrk","year":"2012","unstructured":"Atamt\u00fcrk, A., Kianfar, K.: n-Step mingling inequalities: new facets for the mixed-integer knapsack set. Math. Program. 132(1\u20132), 79\u201398 (2012)","journal-title":"Math. Program."},{"key":"959_CR2","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.1030.0099","volume":"52","author":"A Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A.: Sequence independent lifting for mixed-integer programming. Oper. Res. 52, 487\u2013490 (2004)","journal-title":"Oper. Res."},{"key":"959_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10479-005-3442-1","volume":"139","author":"A Atamt\u00fcrk","year":"2005","unstructured":"Atamt\u00fcrk, A.: Cover and pack inequalities for (mixed) integer programming. Ann. Oper. Res. 139, 21\u201338 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"959_CR4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10107-009-0265-x","volume":"123","author":"A Atamt\u00fcrk","year":"2010","unstructured":"Atamt\u00fcrk, A., G\u00fcnl\u00fck, O.: Mingling: mixed-integer rounding with bounds. Math. Program. 123(2), 315\u2013338 (2010)","journal-title":"Math. Program."},{"key":"959_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0239-4","volume":"122","author":"A Atamt\u00fcrk","year":"2010","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Conic mixed-integer rounding cuts. Math. Program. 122, 1\u201320 (2010)","journal-title":"Math. Program."},{"key":"959_CR6","doi-asserted-by":"crossref","unstructured":"Bansal, M., Kianfar, K.: n-Step cycle inequalities: facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem. In: Lee, J., Vygen, J. (eds.) Integer Programming and Combinatorial Optimization, no. 8494 in Lecture Notes in Computer Science, pp. 102\u2013113. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-07557-0_9"},{"key":"959_CR7","doi-asserted-by":"publisher","unstructured":"Bansal, M., Kianfar, K.: n-Step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem. Math. Program. Ser. B (2015). doi: 10.1007\/s10107-015-0906-1","DOI":"10.1007\/s10107-015-0906-1"},{"key":"959_CR8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10107-005-0599-y","volume":"105","author":"S Dash","year":"2006","unstructured":"Dash, S., G\u00fcnl\u00fck, O.: Valid inequalities based on simple mixed-integer sets. Math. Program. 105, 29\u201353 (2006)","journal-title":"Math. Program."},{"key":"959_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Z Gu","year":"2000","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.: Sequence independent lifting in mixed integer programming. J. Comb. Optim. 4, 109\u2013129 (2000)","journal-title":"J. Comb. Optim."},{"key":"959_CR10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10107-008-0216-y","volume":"120","author":"K Kianfar","year":"2009","unstructured":"Kianfar, K., Fathi, Y.: Generalized mixed integer rounding inequalities: facets for infinite group polyhedra. Math. Program. 120, 313\u2013346 (2009)","journal-title":"Math. Program."},{"key":"959_CR11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H Marchand","year":"1999","unstructured":"Marchand, H., Wolsey, L.A.: The 0\u20131 knapsack problem with a single continuous variable. Math. Program. 85, 15 (1999)","journal-title":"Math. Program."},{"key":"959_CR12","doi-asserted-by":"crossref","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)"},{"issue":"4","key":"959_CR13","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.disopt.2012.07.003","volume":"9","author":"S Sanjeevi","year":"2012","unstructured":"Sanjeevi, S., Kianfar, K.: Mixed $$n$$ n -step MIR inequalities: facets for the $$n$$ n -mixing set. Discrete Optim. 9(4), 216\u2013235 (2012)","journal-title":"Discrete Optim."},{"key":"959_CR14","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0959-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0959-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0959-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T03:54:20Z","timestamp":1567310060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0959-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,30]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["959"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0959-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,30]]}}}