{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:05:22Z","timestamp":1749614722543,"version":"3.41.0"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031931116","type":"print"},{"value":"9783031931123","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-93112-3_22","type":"book-chapter","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T08:56:26Z","timestamp":1749545786000},"page":"297-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5580-3677","authenticated-orcid":false,"given":"Christoph","family":"Hunkenschr\u00f6der","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7846-0053","authenticated-orcid":false,"given":"Martin","family":"Kouteck\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7935-6218","authenticated-orcid":false,"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8902-5196","authenticated-orcid":false,"given":"Tung\u00a0Anh","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,4]]},"reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/ijoc.2018.0857","volume":"32","author":"T Achterberg","year":"2020","unstructured":"Achterberg, T., Bixby, R.E., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming. INFORMS J. Comput. 32(2), 473\u2013506 (2020)","journal-title":"INFORMS J. Comput."},{"key":"22_CR2","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Inc (1993)"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"SA Alumur","year":"2008","unstructured":"Alumur, S.A., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190(1), 1\u201321 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Anderson, R., Huchette, J., Ma, W., Tjandraatmadja, C., Vielma, J.P.: Strong mixed-integer programming formulations for trained neural networks. Math. Program. 183(1), 3\u201339 (2020)","DOI":"10.1007\/s10107-020-01474-5"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10208-005-0174-1","volume":"7","author":"M Aschenbrenner","year":"2007","unstructured":"Aschenbrenner, M., Hemmecke, R.: Finiteness theorems in stochastic integer programming. Found. Comput. Math. 7(2), 183\u2013227 (2007)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens. Ann. Stat. 44(2), 813\u2013852 (2016)","journal-title":"Ann. Stat."},{"key":"22_CR7","unstructured":"van\u00a0den Briel, M., Vossen, T., Kambhampati, S.: Reviving integer programming approaches for AI planning: a branch-and-cut framework. In: Automated Planning and Scheduling, ICAPS 2005. Proceedings, pp. 310\u2013319. AAAI (2005)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Chen, L., Kyng, R., Liu, Y.P., Meierhans, S., Gutenberg, M.P.: Almost-linear time algorithms for incremental graphs: Cycle detection, sccs, s-t shortest path, and minimum-cost flow. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, pp. 1165\u20131173. ACM (2024)","DOI":"10.1145\/3618260.3649745"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Chen, L., Kyng, R., Liu, Y.P., Peng, R., Gutenberg, M.P., Sachdeva, S.: Maximum flow and minimum-cost flow in almost-linear time. In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, pp. 612\u2013623. IEEE (2022)","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"22_CR10","unstructured":"Chen, L., Marx, D., Ye, D., Zhang, G.: Parameterized and approximation results for scheduling with a low rank processing time matrix. In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017. LIPIcs, vol.\u00a066, pp. 1\u201314. Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Cslovjecsek, J., Eisenbrand, F., Hunkenschr\u00f6der, C., Rohwedder, L., Weismantel, R.: Block-structured integer and linear programming in strongly polynomial and near linear time. In: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, pp. 1666\u20131681. SIAM (2021)","DOI":"10.1137\/1.9781611976465.101"},{"key":"22_CR12","unstructured":"Cslovjecsek, J., Eisenbrand, F., Pilipczuk, M., Venzin, M., Weismantel, R.: Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity. In: 29th Annual European Symposium on Algorithms, ESA 2021. LIPIcs, vol.\u00a0204, pp. 1\u201314. Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Cslovjecsek, J., Kouteck\u00fd, M., Lassota, A., Pilipczuk, M., Polak, A.: Parameterized algorithms for block-structured integer programs with large entries. In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, pp. 740\u2013751. SIAM (2024)","DOI":"10.1137\/1.9781611977912.29"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"De Loera, J.A., Hemmecke, R., K\u00f6ppe, M.: Algebraic and Geometric Ideas in the Theory of Discrete Optimization, MOS-SIAM Series on Optimization, vol.\u00a014. SIAM (2013)","DOI":"10.1137\/1.9781611972443"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"De Loera, J.A., Hemmecke, R., Onn, S., Weismantel, R.: $${N}$$-fold integer programming. Discr. Optim. 5(2), 231\u2013241 (2008). in Memory of George B. Dantzig","DOI":"10.1016\/j.disopt.2006.06.006"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Dong, S., Goranci, G., Li, L., Sachdeva, S., Ye, G.: Fast algorithms for separable linear programs. In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, pp. 3558\u20133604. SIAM (2024)","DOI":"10.1137\/1.9781611977912.127"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Dong, S., Lee, Y.T., Ye, G.: A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path. In: STOC \u201921: 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1784\u20131797. ACM (2021)","DOI":"10.1145\/3406325.3451056"},{"key":"22_CR18","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K.: Faster algorithms for integer programs with block structure. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. LIPIcs, vol.\u00a0107, pp. 1\u201313. Schloss Dagstuhl \u2014 Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"6","key":"22_CR19","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.orl.2023.10.001","volume":"51","author":"F Eisenbrand","year":"2023","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K., Kouteck\u00fd, M., Levin, A., Onn, S.: Reducibility bounds of objective functions over the integers. Oper. Res. Lett. 51(6), 595\u2013598 (2023)","journal-title":"Oper. Res. Lett."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K.M., Kouteck\u00fd, M., Levin, A., Onn, S.: Sparse integer programming is fixed-parameter tractable. Math. Oper. Res. 0(0) (2024)","DOI":"10.1287\/moor.2023.0162"},{"issue":"1","key":"22_CR21","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10479-005-3446-x","volume":"139","author":"CA Floudas","year":"2005","unstructured":"Floudas, C.A., Lin, X.: Mixed integer linear programming in process scheduling: modeling, algorithms, and applications. Ann. Oper. Res. 139(1), 131\u2013162 (2005)","journal-title":"Ann. Oper. Res."},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Gaven\u010diak, T., Kouteck\u00fd, M., Knop, D.: Integer programming in parameterized complexity: five miniatures. Discret. Optim. 44(Part), 100596 (2022)","DOI":"10.1016\/j.disopt.2020.100596"},{"issue":"1","key":"22_CR23","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01681344","volume":"9","author":"JE Graver","year":"1975","unstructured":"Graver, J.E.: On the foundations of linear and integer linear programming I. Math. Program. 9(1), 207\u2013226 (1975)","journal-title":"Math. Program."},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Algorithms and Combinatorics, vol. 2, second edn. Springer-Verlag, Berlin (1993)","DOI":"10.1007\/978-3-642-78240-4"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Hemmecke, R., K\u00f6ppe, M., Weismantel, R.: Graver basis and proximity techniques for block-structured separable convex integer minimization problems. Math. Programm. 145(1-2, Ser. A), 1\u201318 (2014)","DOI":"10.1007\/s10107-013-0638-z"},{"issue":"1\u20132","key":"22_CR26","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-011-0490-y","volume":"137","author":"R Hemmecke","year":"2013","unstructured":"Hemmecke, R., Onn, S., Romanchuk, L.: $$n$$-fold integer programming in cubic time. Math. Program. 137(1\u20132), 325\u2013341 (2013)","journal-title":"Math. Program."},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10107-002-0322-1","volume":"94","author":"R Hemmecke","year":"2003","unstructured":"Hemmecke, R., Schultz, R.: Decomposition of test sets in stochastic integer programming. Math. Program. 94, 323\u2013341 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"22_CR28","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1287\/moor.19.2.390","volume":"19","author":"DS Hochbaum","year":"1994","unstructured":"Hochbaum, D.S.: Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Math. Oper. Res. 19(2), 390\u2013409 (1994)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"22_CR29","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"DS Hochbaum","year":"1990","unstructured":"Hochbaum, D.S., Shanthikumar, J.G.: Convex separable optimization is not much harder than linear optimization. JACM 37(4), 843\u2013862 (1990)","journal-title":"JACM"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Hunkenschr\u00f6der, C., Klein, K., Kouteck\u00fd, M., Lassota, A., Levin, A.: Tight lower bounds for block-structured integer programs. In: Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024. Lecture Notes in Computer Science, vol. 14679, pp. 224\u2013237. Springer (2024)","DOI":"10.1007\/978-3-031-59835-7_17"},{"issue":"2","key":"22_CR31","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1007\/s10107-022-01837-0","volume":"197","author":"K Jansen","year":"2023","unstructured":"Jansen, K., Klein, K., Lassota, A.: The double exponential runtime is tight for 2-stage stochastic ILPs. Math. Program. 197(2), 1145\u20131172 (2023)","journal-title":"Math. Program."},{"issue":"1","key":"22_CR32","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10107-021-01694-3","volume":"195","author":"K Jansen","year":"2022","unstructured":"Jansen, K., Klein, K., Maack, M., Rau, M.: Empowering the configuration-IP: new PTAS results for scheduling with setup times. Math. Program. 195(1), 367\u2013401 (2022)","journal-title":"Math. Program."},{"issue":"4","key":"22_CR33","doi-asserted-by":"publisher","first-page":"2282","DOI":"10.1137\/19M1303873","volume":"34","author":"K Jansen","year":"2020","unstructured":"Jansen, K., Lassota, A., Rohwedder, L.: Near-linear time algorithm for $$n$$-fold ILPs via color coding. SIAM J. Discret. Math. 34(4), 2282\u20132299 (2020)","journal-title":"SIAM J. Discret. Math."},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, The IBM Research Symposia Series, pp. 85\u2013103. Springer (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"22_CR35","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-021-01698-z","volume":"192","author":"K Klein","year":"2022","unstructured":"Klein, K.: About the complexity of two-stage stochastic IPs. Math. Program. 192(1), 319\u2013337 (2022)","journal-title":"Math. Program."},{"key":"22_CR36","doi-asserted-by":"crossref","unstructured":"Klein, K., Reuter, J.: Collapsing the tower \u2014 on the complexity of multistage stochastic IPs. In: 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, pp. 348\u2013358. SIAM (2022)","DOI":"10.1137\/1.9781611977073.17"},{"key":"22_CR37","unstructured":"Knop, D., Kouteck\u00fd, M., Levin, A., Mnich, M., Onn, S.: Multitype integer monoid optimization and applications. CoRR abs\/1909.07326 (2019)"},{"issue":"5","key":"22_CR38","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10951-017-0550-0","volume":"21","author":"D Knop","year":"2018","unstructured":"Knop, D., Kouteck\u00fd, M.: Scheduling meets $$n$$-fold integer programming. J. Sched. 21(5), 493\u2013503 (2018)","journal-title":"J. Sched."},{"issue":"6","key":"22_CR39","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.orl.2021.11.005","volume":"49","author":"D Knop","year":"2021","unstructured":"Knop, D., Kouteck\u00fd, M., Levin, A., Mnich, M., Onn, S.: Parameterized complexity of configuration integer programs. Oper. Res. Lett. 49(6), 908\u2013913 (2021)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"22_CR40","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-022-01882-9","volume":"200","author":"D Knop","year":"2023","unstructured":"Knop, D., Kouteck\u00fd, M., Levin, A., Mnich, M., Onn, S.: High-multiplicity $${N}$$-fold IP via configuration LP. Math. Program. 200(1), 199\u2013227 (2023)","journal-title":"Math. Program."},{"issue":"1","key":"22_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01402-2","volume":"184","author":"D Knop","year":"2020","unstructured":"Knop, D., Kouteck\u00fd, M., Mnich, M.: Combinatorial $$n$$-fold integer programming and applications. Math. Program. 184(1), 1\u201334 (2020)","journal-title":"Math. Program."},{"key":"22_CR42","doi-asserted-by":"crossref","unstructured":"Knop, D., Kouteck\u00fd, M., Mnich, M.: Voting and bribing in single-exponential time. ACM Trans. Econ. Comput. 8(3), 1\u201328 (2020)","DOI":"10.1145\/3396855"},{"key":"22_CR43","doi-asserted-by":"crossref","unstructured":"Knop, D., Pilipczuk, M., Wrochna, M.: Tight complexity lower bounds for integer linear programming with few constraints. ACM Trans. Comput. Theory 12(3), 1\u201319 (2020)","DOI":"10.1145\/3397484"},{"issue":"4","key":"22_CR44","first-page":"857","volume":"32","author":"B Knueven","year":"2020","unstructured":"Knueven, B., Ostrowski, J., Watson, J.: On mixed-integer programming formulations for the unit commitment problem. INFORMS J. Comput. 32(4), 857\u2013876 (2020)","journal-title":"INFORMS J. Comput."},{"key":"22_CR45","unstructured":"Kouteck\u00fd, M., Levin, A., Onn, S.: A parameterized strongly polynomial algorithm for block structured integer programs. In: Proceedings of ICALP 2018. Leibniz International Proceedings Informatics, vol.\u00a0107, pp. 1\u201314 (2018)"},{"key":"22_CR46","doi-asserted-by":"crossref","unstructured":"Lau, L.C., Ravi, R., Singh, M.: Iterative Methods in Combinatorial Optimization, vol.\u00a046. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511977152"},{"issue":"2","key":"22_CR47","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141(2), 241\u2013252 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"22_CR48","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10107-003-0466-7","volume":"99","author":"K Murota","year":"2004","unstructured":"Murota, K., Tamura, A.: Proximity theorems of discrete convex functions. Math. Program. 99(3), 539\u2013562 (2004)","journal-title":"Math. Program."},{"issue":"1","key":"22_CR49","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0196-6774(92)90006-X","volume":"13","author":"CH Norton","year":"1992","unstructured":"Norton, C.H., Plotkin, S.A., Tardos, \u00c9.: Using separation algorithms in fixed dimension. J. Algorithms 13(1), 79\u201398 (1992)","journal-title":"J. Algorithms"},{"key":"22_CR50","doi-asserted-by":"crossref","unstructured":"Onn, S.: Nonlinear discrete optimization. Zurich Lectures in Advanced Mathematics, European Mathematical Society (2010)","DOI":"10.4171\/093"},{"key":"22_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1007\/978-3-662-43948-7_77","volume-title":"Automata, Languages, and Programming","author":"F Reidl","year":"2014","unstructured":"Reidl, F., Rossmanith, P., Villaamil, F.S., Sikdar, S.: A faster parameterized algorithm for Treedepth. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 931\u2013942. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_77"},{"issue":"3","key":"22_CR52","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1111\/j.1467-9574.1996.tb01506.x","volume":"50","author":"R Schultz","year":"1996","unstructured":"Schultz, R., Stougie, L., van der Vlerk, M.H.: Two-stage stochastic integer programming: a survey. Stat. Neerl. 50(3), 404\u2013416 (1996)","journal-title":"Stat. Neerl."},{"key":"22_CR53","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Society for Industrial and Applied Mathematics (2001)","DOI":"10.1137\/1.9780898718515"},{"key":"22_CR54","unstructured":"Vossen, T., Ball, M.O., Lotem, A., Nau, D.S.: On the use of integer programming models in AI planning. In: International Joint Conference on Artificial Intelligence, IJCAI 99. Proceedings, pp. 304\u2013309. Morgan Kaufmann (1999)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-93112-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T08:56:34Z","timestamp":1749545794000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-93112-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031931116","9783031931123"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-93112-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Baltimore, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco25.cs.jhu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}