{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:16:42Z","timestamp":1781345802616,"version":"3.54.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T00:00:00Z","timestamp":1704326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T00:00:00Z","timestamp":1704326400000},"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":["Math. Program."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10107-023-02046-z","type":"journal-article","created":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T14:02:06Z","timestamp":1704376926000},"page":"463-496","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["FPT algorithms for a special block-structured integer program with applications in scheduling"],"prefix":"10.1007","volume":"208","author":[{"given":"Hua","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,4]]},"reference":[{"issue":"1","key":"2046_CR1","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/s00170-007-0950-y","volume":"37","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Al-Anzi, F.S.: The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time. Int. J. Adv. Manuf. Technol. 37(1), 166\u2013177 (2008)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"9","key":"2046_CR2","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1057\/palgrave.jors.2601403","volume":"53","author":"A Allahverdi","year":"2002","unstructured":"Allahverdi, A., Aldowaisan, T.: No-wait flowshops with bicriteria of makespan and total completion time. J. Oper. Res. Soc. 53(9), 1004\u20131015 (2002)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"2046_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3330137","volume":"24","author":"K Altmanov\u00e1","year":"2019","unstructured":"Altmanov\u00e1, K., Knop, D., Kouteck\u00fd, M.: Evaluating and tuning n-fold integer programming. J. Exp. Algorithmics 24(1), 1\u201322 (2019)","journal-title":"J. Exp. Algorithmics"},{"issue":"2","key":"2046_CR4","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."},{"key":"2046_CR5","doi-asserted-by":"publisher","first-page":"100743","DOI":"10.1016\/j.disopt.2022.100743","volume":"46","author":"H Chen","year":"2022","unstructured":"Chen, H., Chen, L., Zhang, G.: Block-structured integer programming: can we parameterize without the largest coefficient? Discrete Optim. 46, 100743 (2022)","journal-title":"Discrete Optim."},{"key":"2046_CR6","unstructured":"Chen, L., Kouteck\u00fd, M., Xu, L., Shi, W.: New bounds on augmenting steps of block-structured integer programs. In: Proceedings of the 28th Annual European Symposium on Algorithms (ESA), LIPIcs, vol. 173, pp. 33:1\u201333:19 (2020)"},{"key":"2046_CR7","doi-asserted-by":"crossref","unstructured":"Chen, L., Marx, D.: Covering a tree with rooted subtrees\u2013parameterized and approximation algorithms. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2801\u20132820. SIAM (2018)","DOI":"10.1137\/1.9781611975031.178"},{"issue":"5","key":"2046_CR8","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1057\/jors.2014.58","volume":"66","author":"M Cheng","year":"2015","unstructured":"Cheng, M., Tadikamalla, P.R., Shang, J., Zhang, B.: Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time. J. Oper. Res. Soc. 66(5), 709\u2013719 (2015)","journal-title":"J. Oper. Res. Soc."},{"key":"2046_CR9","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: Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1666\u20131681. SIAM (2021)","DOI":"10.1137\/1.9781611976465.101"},{"key":"2046_CR10","unstructured":"Cslovjecsek, J., Eisenbrand, F., Pilipczuk, M., Venzin, M., Weismantel, R.: Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity. In: Proceedings of the 29th Annual European Symposium on Algorithms (ESA), LIPIcs, vol. 204, pp. 33:1\u201333:14 (2021)"},{"key":"2046_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)"},{"key":"2046_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972443","volume-title":"Algebraic and Geometric Ideas in the Theory of Discrete Optimization","author":"JA De Loera","year":"2012","unstructured":"De Loera, J.A., Hemmecke, R., K\u00f6ppe, M.: Algebraic and Geometric Ideas in the Theory of Discrete Optimization. SIAM, Philadelphia (2012)"},{"issue":"2","key":"2046_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.disopt.2006.06.006","volume":"5","author":"JA De Loera","year":"2008","unstructured":"De Loera, J.A., Hemmecke, R., Onn, S., Weismantel, R.: N-fold integer programming. Discrete Optim. 5(2), 231\u2013241 (2008)","journal-title":"Discrete Optim."},{"key":"2046_CR14","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K.M.: Faster algorithms for integer programs with block structure. In: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP), LIPIcs, vol. 107, pp. 49:1\u201349:13 (2018)"},{"key":"2046_CR15","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K.M., Kouteck\u00fd, M., Levin, A., Onn, S.: An algorithmic theory of integer programming. arXiv preprint arXiv:1904.01361 (2019)"},{"key":"2046_CR16","doi-asserted-by":"crossref","unstructured":"Ekbatani, F., Natura, B., V\u00e9gh, L.A.: Circuit imbalance measures and linear programming. In: Surveys in Combinatorics, pp. 64\u2013114 (2022)","DOI":"10.1017\/9781009093927.004"},{"issue":"1","key":"2046_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","volume":"49","author":"DW Engels","year":"2003","unstructured":"Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N., Wein, J.: Techniques for scheduling with rejection. J. Algorithms 49(1), 175\u2013191 (2003)","journal-title":"J. Algorithms"},{"issue":"1","key":"2046_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-009-0270-0","volume":"126","author":"R Gollmer","year":"2011","unstructured":"Gollmer, R., Gotzes, U., Schultz, R.: A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse. Math. Program. 126(1), 179\u2013190 (2011)","journal-title":"Math. Program."},{"issue":"1","key":"2046_CR19","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."},{"issue":"2","key":"2046_CR20","first-page":"56","volume":"14","author":"VS Grinberg","year":"1980","unstructured":"Grinberg, V.S., Sevast\u2019yanov, S.V.E.: Value of the steinitz constant. Funktsional\u2019nyi Analiz i ego Prilozheniya 14(2), 56\u201357 (1980)","journal-title":"Funktsional\u2019nyi Analiz i ego Prilozheniya"},{"key":"2046_CR21","doi-asserted-by":"crossref","unstructured":"Hemmecke, R., K\u00f6ppe, M., Weismantel, R.: A polynomial-time algorithm for optimizing over n-fold 4-block decomposable integer programs. In: Proceedings of the 14th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 219\u2013229. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13036-6_17"},{"issue":"1\u20132","key":"2046_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-013-0638-z","volume":"145","author":"R Hemmecke","year":"2014","unstructured":"Hemmecke, R., K\u00f6ppe, M., Weismantel, R.: Graver basis and proximity techniques for block-structured separable convex integer minimization problems. Math. Program. 145(1\u20132), 1\u201318 (2014)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2046_CR23","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."},{"issue":"2\u20133","key":"2046_CR24","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(2\u20133), 323\u2013341 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"2046_CR25","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-002-0324-z","volume":"94","author":"H Hoogeveen","year":"2003","unstructured":"Hoogeveen, H., Skutella, M., Woeginger, G.J.: Preemptive scheduling with rejection. Math. Program. 94(2), 361\u2013374 (2003)","journal-title":"Math. Program."},{"key":"2046_CR26","doi-asserted-by":"crossref","unstructured":"Jansen, K., Klein, K.M., Lassota, A.: The double exponential runtime is tight for 2-stage stochastic ILPs. In: Proceedings of the 22nd International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 297\u2013310. Springer, Berlin (2021)","DOI":"10.1007\/978-3-030-73879-2_21"},{"issue":"1\u20132","key":"2046_CR27","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.M., Maack, M., Rau, M.: Empowering the configuration-IP: new PTAS results for scheduling with setup times. Math. Program. 195(1\u20132), 367\u2013401 (2022)","journal-title":"Math. Program."},{"issue":"4","key":"2046_CR28","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. Discrete Math. 34(4), 2282\u20132299 (2020)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"2046_CR29","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1287\/opre.40.1.178","volume":"40","author":"J Kennington","year":"1992","unstructured":"Kennington, J., Wang, Z.: A shortest augmenting path algorithm for the semi-assignment problem. Oper. Res. 40(1), 178\u2013187 (1992)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"2046_CR30","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-021-01698-z","volume":"192","author":"KM Klein","year":"2022","unstructured":"Klein, K.M.: About the complexity of two-stage stochastic IPs. Math. Program. 192(1\u20132), 319\u2013337 (2022)","journal-title":"Math. Program."},{"issue":"5","key":"2046_CR31","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."},{"key":"2046_CR32","unstructured":"Knop, D., Kouteck\u00fd, M., Levin, A., Mnich, M., Onn, S.: Multitype integer monoid optimization and applications. arXiv preprint arXiv:1909.07326 (2019)"},{"key":"2046_CR33","doi-asserted-by":"crossref","unstructured":"Knop, D., Kouteck\u00fd, M., Levin, A., Mnich, M., Onn, S.: High-multiplicity N-fold IP via configuration LP. Math. Program. 1\u201329 (2022)","DOI":"10.1007\/s10107-022-01882-9"},{"issue":"1","key":"2046_CR34","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":"2046_CR35","unstructured":"Kouteck\u00fd, M., Levin, A., Onn, S.: A parameterized strongly polynomial algorithm for block structured integer programs. In: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP), LIPIcs, vol. 107, pp. 85:1\u201385:14 (2018)"},{"issue":"1","key":"2046_CR36","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10107-014-0830-9","volume":"154","author":"M Mnich","year":"2015","unstructured":"Mnich, M., Wiese, A.: Scheduling and fixed-parameter tractability. Math. Program. 154(1), 533\u2013562 (2015)","journal-title":"Math. Program."},{"key":"2046_CR37","doi-asserted-by":"crossref","unstructured":"Oertel, T., Paat, J., Weismantel, R.: A colorful Steinitz Lemma with application to block-structured integer programs. Math. Program. 1\u201326 (2023)","DOI":"10.1007\/s10107-023-01971-3"},{"key":"2046_CR38","doi-asserted-by":"crossref","unstructured":"Onn, S.: Nonlinear discrete optimization. Zurich Lectures in Advanced Mathematics, European Mathematical Society (2010)","DOI":"10.4171\/093"},{"issue":"2","key":"2046_CR39","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.ejor.2005.09.014","volume":"176","author":"DW Pentico","year":"2007","unstructured":"Pentico, D.W.: Assignment problems: a golden anniversary survey. Eur. J. Oper. Res. 176(2), 774\u2013793 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"143","key":"2046_CR40","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1515\/crll.1913.143.128","volume":"1913","author":"E Steinitz","year":"1913","unstructured":"Steinitz, E.: Bedingt konvergente reihen und konvexe systeme. Journal f\u00fcr die reine und angewandte Mathematik (Crelles Journal) 1913(143), 128\u2013176 (1913)","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik (Crelles Journal)"},{"key":"2046_CR41","doi-asserted-by":"crossref","unstructured":"Sviridenko, M., Wiese, A.: Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines. In: Proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 387\u2013398. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36694-9_33"},{"issue":"2","key":"2046_CR42","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E Tardos","year":"1986","unstructured":"Tardos, E.: A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34(2), 250\u2013256 (1986)","journal-title":"Oper. Res."},{"issue":"9","key":"2046_CR43","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1080\/00207543.2014.884290","volume":"52","author":"F Xiong","year":"2014","unstructured":"Xiong, F., Xing, K.: Meta-heuristics for the distributed two-stage assembly scheduling problem with bi-criteria of makespan and mean completion time. Int. J. Prod. Res. 52(9), 2743\u20132766 (2014)","journal-title":"Int. J. Prod. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02046-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-02046-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02046-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T16:09:11Z","timestamp":1729008551000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-02046-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,4]]},"references-count":43,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2046"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-02046-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,4]]},"assertion":[{"value":"16 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}