{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:29:44Z","timestamp":1765960184666,"version":"3.37.3"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T00:00:00Z","timestamp":1628640000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T00:00:00Z","timestamp":1628640000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2015-05072","RGPIN-2015-04152"],"award-info":[{"award-number":["RGPIN-2015-05072","RGPIN-2015-04152"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10107-021-01699-y","type":"journal-article","created":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T10:09:34Z","timestamp":1628676574000},"page":"115-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A combinatorial cut-and-lift procedure with an application to 0\u20131 second-order conic programming"],"prefix":"10.1007","volume":"196","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4689-6143","authenticated-orcid":false,"given":"Margarita P.","family":"Castro","sequence":"first","affiliation":[]},{"given":"Andre A.","family":"Cire","sequence":"additional","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"1699_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall Inc, Hoboken (1993)"},{"key":"1699_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, H.R., Hadzic, T., Hooker, J.N., Tiedemann, P.: A constraint store based on multivalued decision diagrams. In: International Conference on Principles and Practice of Constraint Programming\u2013CP 2007, pp. 118\u2013132. Springer (2007)","DOI":"10.1007\/978-3-540-74970-7_11"},{"issue":"1","key":"1699_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1002\/net.21769","volume":"71","author":"A Atamt\u00fcrk","year":"2018","unstructured":"Atamt\u00fcrk, A., Bhardwaj, A.: Network design with probabilistic capacities. Networks 71(1), 16\u201330 (2018)","journal-title":"Networks"},{"issue":"3","key":"1699_CR4","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1287\/ijoc.1120.0511","volume":"25","author":"A Atamt\u00fcrk","year":"2013","unstructured":"Atamt\u00fcrk, A., Muller, L.F., Pisinger, D.: Separation and extension of cover inequalities for conic quadratic knapsack constraints with generalized upper bounds. INFORMS J. Comput. 25(3), 420\u2013431 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"1699_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.disopt.2009.03.002","volume":"6","author":"A Atamt\u00fcrk","year":"2009","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: The submodular knapsack polytope. Discret. Optim. 6(4), 333\u2013344 (2009)","journal-title":"Discret. Optim."},{"issue":"1","key":"1699_CR6","doi-asserted-by":"publisher","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), 1\u201320 (2010)","journal-title":"Math. Program."},{"issue":"1","key":"1699_CR7","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. Program. 8(1), 146\u2013164 (1975)","journal-title":"Math. Program."},{"key":"1699_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00148-3","volume-title":"Disjunctive Programming","author":"E Balas","year":"2018","unstructured":"Balas, E.: Disjunctive Programming. Springer, Berlin (2018)"},{"issue":"1\u20133","key":"1699_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58(1\u20133), 295\u2013324 (1993)","journal-title":"Math. Program."},{"issue":"9","key":"1699_CR10","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework. Manag. Sci. 42(9), 1229\u20131246 (1996)","journal-title":"Manag. Sci."},{"key":"1699_CR11","doi-asserted-by":"crossref","unstructured":"Becker, B., Behle, M., Eisenbrand, F., Wimmer, R.: BDDs in a branch and cut framework. In: International Workshop on Experimental and Efficient Algorithms, pp. 452\u2013463. Springer, Berlin (2005)","DOI":"10.1007\/11427186_39"},{"key":"1699_CR12","unstructured":"Behle, M.: Binary decision diagrams and integer programming. Ph.D. Thesis (2007)"},{"key":"1699_CR13","doi-asserted-by":"crossref","unstructured":"Bergman, D., Cardonha, C., Mehrani, S.: Binary decision diagrams for bin packing with minimum color fragmentation. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research\u2013CPAIOR 2019, pp. 57\u201366. Springer, Berlin (2019)","DOI":"10.1007\/978-3-030-19212-9_4"},{"issue":"10","key":"1699_CR14","doi-asserted-by":"publisher","first-page":"4700","DOI":"10.1287\/mnsc.2017.2849","volume":"64","author":"D Bergman","year":"2018","unstructured":"Bergman, D., Cire, A.A.: Discrete nonlinear optimization by state-space decompositions. Manag. Sci. 64(10), 4700\u20134720 (2018)","journal-title":"Manag. Sci."},{"key":"1699_CR15","doi-asserted-by":"crossref","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.N.: Variable ordering for the application of BDDs to the maximum independent set problem. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research\u2013CPAIOR 2012, pp. 34\u201349. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-29828-8_3"},{"issue":"1","key":"1699_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1287\/ijoc.2015.0648","volume":"28","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.N.: Discrete optimization with decision diagrams. INFORMS J. Comput. 28(1), 47\u201366 (2016)","journal-title":"INFORMS J. Comput."},{"key":"1699_CR17","unstructured":"Bergman, D., Lozano, L.: Decision diagram decomposition for quadratically constrained binary optimization. Optimization Online e-prints (2018)"},{"key":"1699_CR18","unstructured":"Bhardwaj, A.: Binary conic quadratic knapsacks. Ph.D. thesis, UC Berkeley (2015)"},{"key":"1699_CR19","doi-asserted-by":"crossref","unstructured":"Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: Mixed-integer programming: a progress report. In: The Sharpest Cut: The Impact of Manfred Padberg and His Work, pp. 309\u2013325. SIAM (2004)","DOI":"10.1137\/1.9780898718805.ch18"},{"issue":"8","key":"1699_CR20","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"100","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 100(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"1699_CR21","doi-asserted-by":"crossref","unstructured":"Castro, M.P., Cire, A.A., Beck, J.C.: An MDD-based Lagrangian approach to the multicommodity pickup-and-delivery tsp. INFORMS J. Comput. 32(2), 263\u2013278 (2019)","DOI":"10.1287\/ijoc.2018.0881"},{"key":"1699_CR22","doi-asserted-by":"crossref","unstructured":"Castro, M.P., Piacentini, C., Cire, A.A., Beck, J.C.: Relaxed BDDs: an admissible heuristic for delete-free planning based on a discrete relaxation. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 77\u201385 (2019)","DOI":"10.1609\/icaps.v29i1.3462"},{"issue":"6","key":"1699_CR23","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1287\/opre.2013.1221","volume":"61","author":"AA Cire","year":"2013","unstructured":"Cire, A.A., van Hoeve, W.J.: Multivalued decision diagrams for sequencing problems. Oper. Res. 61(6), 1411\u20131428 (2013)","journal-title":"Oper. Res."},{"issue":"7","key":"1699_CR24","doi-asserted-by":"publisher","first-page":"3255","DOI":"10.1287\/mnsc.2018.3091","volume":"65","author":"MC Cohen","year":"2019","unstructured":"Cohen, M.C., Keller, P.W., Mirrokni, V., Zadimoghaddam, M.: Overcommitment in cloud services: bin packing with chance constraints. Manag. Sci. 65(7), 3255\u20133271 (2019)","journal-title":"Manag. Sci."},{"key":"1699_CR25","doi-asserted-by":"crossref","unstructured":"Davarnia, D., van Hoeve, W.J.: Outer approximation for integer nonlinear programs via decision diagrams. Math. Program. 187, 111\u2013150 (2020)","DOI":"10.1007\/s10107-020-01475-4"},{"issue":"4","key":"1699_CR26","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"RE Gomory","year":"1969","unstructured":"Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2(4), 451\u2013558 (1969)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"1699_CR27","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.: Lifted cover inequalities for 0\u20131 integer programs: Computation. INFORMS J. Comput. 10(4), 427\u2013437 (1998)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"1699_CR28","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/ijoc.11.1.117","volume":"11","author":"Z Gu","year":"1999","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.: Lifted cover inequalities for 0\u20131 integer programs: Complexity. INFORMS J. Comput. 11(1), 117\u2013123 (1999)","journal-title":"INFORMS J. Comput."},{"key":"1699_CR29","unstructured":"Gurobi\u00a0Optimization, L.: Gurobi optimizer reference manual (2020)"},{"issue":"1","key":"1699_CR30","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.: Facet of regular 0\u20131 polytopes. Math. Program. 8(1), 179\u2013206 (1975)","journal-title":"Math. Program."},{"key":"1699_CR31","doi-asserted-by":"crossref","unstructured":"Hoda, S., Van\u00a0Hoeve, W.J., Hooker, J.N.: A systematic approach to MDD-based constraint programming. In: International Conference on Principles and Practice of Constraint Programming\u2013CP 2010, pp. 266\u2013280. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15396-9_23"},{"key":"1699_CR32","doi-asserted-by":"crossref","unstructured":"Hooker, J.N.: Job sequencing bounds from decision diagrams. In: International Conference on Principles and Practice of Constraint Programming\u2013CP 2017, pp. 565\u2013578. Springer, Berlin (2017)","DOI":"10.1007\/978-3-319-66158-2_36"},{"key":"1699_CR33","unstructured":"IBM: ILOG CPLEX Studio 12.9 Manual (2019)"},{"issue":"5","key":"1699_CR34","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.orl.2017.08.006","volume":"45","author":"S Joung","year":"2017","unstructured":"Joung, S., Park, S.: Lifting of probabilistic cover inequalities. Oper. Res. Lett. 45(5), 513\u2013518 (2017)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1699_CR35","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1287\/moor.2015.0737","volume":"41","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2016","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F.: On minimal valid inequalities for mixed integer conic programs. Math. Oper. Res. 41(2), 477\u2013510 (2016)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"1699_CR36","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10107-015-0903-4","volume":"154","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2015","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F., Y\u0131ld\u0131z, S.: Two-term disjunctions on the second-order cone. Math. Program. 154(1\u20132), 463\u2013491 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"1699_CR37","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.ejor.2016.11.035","volume":"259","author":"J Kinable","year":"2017","unstructured":"Kinable, J., Cire, A.A., van Hoeve, W.J.: Hybrid optimization methods for time-dependent sequencing problems. Eur. J. Oper. Res. 259(3), 887\u2013897 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"1699_CR38","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"MS Lobo","year":"1998","unstructured":"Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284(1\u20133), 193\u2013228 (1998)","journal-title":"Linear Algebra Appl."},{"key":"1699_CR39","doi-asserted-by":"crossref","unstructured":"Lodi, A.: Mixed integer programming computation. In: 50 Years of Integer Programming 1958\u20132008, pp. 619\u2013645. Springer, Berlin (2010)","DOI":"10.1007\/978-3-540-68279-0_16"},{"key":"1699_CR40","unstructured":"Lodi, A., Tanneau, M., Vielma, J.P.: Disjunctive cuts for mixed-integer conic optimization. arXiv preprint arXiv:1912.03166 (2019)"},{"issue":"3","key":"1699_CR41","first-page":"173","volume":"1","author":"Q Louveaux","year":"2003","unstructured":"Louveaux, Q., Wolsey, L.A.: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 1(3), 173\u2013207 (2003)","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"key":"1699_CR42","doi-asserted-by":"crossref","unstructured":"Lozano, L., Smith, J.C.: A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs. Math. Program. 1\u201324 (2018)","DOI":"10.1007\/s10107-018-1315-z"},{"issue":"1","key":"1699_CR43","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.orl.2014.10.006","volume":"43","author":"S Modaresi","year":"2015","unstructured":"Modaresi, S., K\u0131l\u0131n\u00e7, M.R., Vielma, J.P.: Split cuts and extended formulations for mixed integer conic quadratic programming. Oper. Res. Lett. 43(1), 10\u201315 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1699_CR44","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-Interscience, New York (1988)"},{"issue":"1","key":"1699_CR45","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"MW Padberg","year":"1973","unstructured":"Padberg, M.W.: On the facial structure of set packing polyhedra. Math. Program. 5(1), 199\u2013215 (1973)","journal-title":"Math. Program."},{"issue":"4","key":"1699_CR46","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"MW Padberg","year":"1975","unstructured":"Padberg, M.W.: A note on zero-one programming. Oper. Res. 23(4), 833\u2013837 (1975)","journal-title":"Oper. Res."},{"key":"1699_CR47","doi-asserted-by":"crossref","unstructured":"Perregaard, M., Balas, E.: Generating cuts from multiple-term disjunctions. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 348\u2013360. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45535-3_27"},{"key":"1699_CR48","unstructured":"Raghunathan, A.U., Bergman, D., Hooker, J.N., Serra, T., Kobori, S.: Seamless multimodal transportation scheduling. arXiv preprint arXiv:1807.09676 (2018)"},{"key":"1699_CR49","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.disopt.2016.11.001","volume":"24","author":"A Santana","year":"2017","unstructured":"Santana, A., Dey, S.S.: Some cut-generating functions for second-order conic sets. Discret. Optim. 24, 51\u201365 (2017)","journal-title":"Discret. Optim."},{"issue":"4","key":"1699_CR50","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1287\/opre.2017.1703","volume":"66","author":"A \u015een","year":"2018","unstructured":"\u015een, A., Atamt\u00fcrk, A., Kaminsky, P.: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model. Oper. Res. 66(4), 994\u20131003 (2018)","journal-title":"Oper. Res."},{"issue":"3","key":"1699_CR51","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86(3), 515\u2013532 (1999)","journal-title":"Math. Program."},{"issue":"2","key":"1699_CR52","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1287\/ijoc.2018.0830","volume":"31","author":"C Tjandraatmadja","year":"2019","unstructured":"Tjandraatmadja, C., van Hoeve, W.J.: Target cuts from relaxed decision diagrams. INFORMS J. Comput. 31(2), 285\u2013301 (2019)","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"1699_CR53","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1016\/j.orl.2018.11.003","volume":"46","author":"P van den Bogaerdt","year":"2018","unstructured":"van den Bogaerdt, P., de Weerdt, M.: Multi-machine scheduling lower bounds using decision diagrams. Oper. Res. Lett. 46(6), 616\u2013621 (2018)","journal-title":"Oper. Res. Lett."},{"key":"1699_CR54","doi-asserted-by":"crossref","unstructured":"van\u00a0den Bogaerdt, P., de\u00a0Weerdt, M.: Lower bounds for uniform machine scheduling using decision diagrams. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research\u2013CPAIOR 2019, pp. 565\u2013580. Springer, Berlin (2019)","DOI":"10.1007\/978-3-030-19212-9_38"},{"issue":"3","key":"1699_CR55","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1287\/mnsc.9.3.405","volume":"9","author":"C Van de Panne","year":"1963","unstructured":"Van de Panne, C., Popp, W.: Minimum-cost cattle feed under probabilistic protein constraints. Manag. Sci. 9(3), 405\u2013430 (1963)","journal-title":"Manag. Sci."},{"issue":"3","key":"1699_CR56","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/ijoc.1070.0256","volume":"20","author":"JP Vielma","year":"2008","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.L.: A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs. INFORMS J. Comput. 20(3), 438\u2013450 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"1699_CR57","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s12532-016-0113-y","volume":"9","author":"JP Vielma","year":"2017","unstructured":"Vielma, J.P., Dunning, I., Huchette, J., Lubin, M.: Extended formulations in mixed integer conic quadratic programming. Math. Program. Comput. 9(3), 369\u2013418 (2017)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"1699_CR58","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1287\/opre.24.2.367","volume":"24","author":"LA Wolsey","year":"1976","unstructured":"Wolsey, L.A.: Technical note\u2013facets and strong valid inequalities for integer programs. Oper. Res. 24(2), 367\u2013372 (1976). https:\/\/doi.org\/10.1287\/opre.24.2.367","journal-title":"Oper. Res."},{"key":"1699_CR59","volume-title":"Integer and Combinatorial Optimization","author":"LA Wolsey","year":"1999","unstructured":"Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization, vol. 55. Wiley, New York (1999)"},{"issue":"4","key":"1699_CR60","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1287\/moor.14.4.760","volume":"14","author":"E Zemel","year":"1989","unstructured":"Zemel, E.: Easily computable facets of the knapsack polytope. Math. Oper. Res. 14(4), 760\u2013764 (1989)","journal-title":"Math. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01699-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01699-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01699-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T05:06:33Z","timestamp":1667883993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01699-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,11]]},"references-count":60,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1699"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01699-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2021,8,11]]},"assertion":[{"value":"13 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}