{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:34:31Z","timestamp":1740123271011,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004070","name":"Khalifa University of Science, Technology and Research","doi-asserted-by":"publisher","award":["CIRA-2020-286"],"award-info":[{"award-number":["CIRA-2020-286"]}],"id":[{"id":"10.13039\/501100004070","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10479-022-05054-y","type":"journal-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T18:08:41Z","timestamp":1667844521000},"page":"173-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximations for generalized unsplittable flow on paths with application to power systems optimization"],"prefix":"10.1007","volume":"320","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6662-9037","authenticated-orcid":false,"given":"Areg","family":"Karapetyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Elbassioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Majid","family":"Khonji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sid Chi-Kin","family":"Chau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Chalermsook, P., Ene, A., & Wiese, A. (2016). Submodular unsplittable flow on trees. In International conference on integer programming and combinatorial optimization (pp. 337\u2013349). Springer.","key":"5054_CR1","DOI":"10.1007\/978-3-319-33461-5_28"},{"key":"5054_CR2","first-page":"31","volume":"99","author":"S Albers","year":"1999","unstructured":"Albers, S., Arora, S., & Khanna, S. (1999). Page replacement for general caching problems. SODA, Citeseer, 99, 31\u201340.","journal-title":"SODA, Citeseer"},{"doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Grandoni, F., Leonardi, S., & Wiese, A. (2014). A mazing (2+ $$\\varepsilon $$)-approximation for unsplittable flow on a path. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms (pp. 26\u201341). Society for Industrial and Applied Mathematics.","key":"5054_CR3","DOI":"10.1137\/1.9781611973402.3"},{"doi-asserted-by":"crossref","unstructured":"Bansal, N., Chakrabarti, A., Epstein, A., & Schieber, B. (2006). A quasi-PTAS for unsplittable flow on line graphs. In Proceedings of the thirty-eighth annual ACM symposium on theory of computing (pp. 721\u2013729). ACM.","key":"5054_CR4","DOI":"10.1145\/1132516.1132617"},{"issue":"1","key":"5054_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2532645","volume":"10","author":"N Bansal","year":"2014","unstructured":"Bansal, N., Friggstad, Z., Khandekar, R., & Salavatipour, M. R. (2014). A logarithmic approximation for unsplittable flow on line graphs. ACM Transactions on Algorithms (TALG), 10(1), 1.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"issue":"5","key":"5054_CR6","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., & Schieber, B. (2001). A unified approach to approximating resource allocation and scheduling. Journal of the ACM (JACM), 48(5), 1069\u20131090.","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"5054_CR7","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1109\/61.19266","volume":"4","author":"M Baran","year":"1989","unstructured":"Baran, M., & Wu, F. F. (1989). Optimal sizing of capacitors placed on a radial distribution system. IEEE Transactions on Power Delivery, 4(1), 735\u2013743. https:\/\/doi.org\/10.1109\/61.19266","journal-title":"IEEE Transactions on Power Delivery"},{"doi-asserted-by":"crossref","unstructured":"Batra, J., Garg, N., Kumar, A., Momke, T., & Wiese, A. (2015). New approximation schemes for unsplittable flow on a path. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete algorithms (pp. 47\u201358). Society for Industrial and Applied Mathematics.","key":"5054_CR8","DOI":"10.1137\/1.9781611973730.5"},{"issue":"3","key":"5054_CR9","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/TCNS.2015.2401172","volume":"2","author":"S Bose","year":"2015","unstructured":"Bose, S., Gayme, D. F., Chandy, K. M., & Low, S. H. (2015). Quadratically constrained quadratic programs on acyclic graphs with application to power flow. IEEE Transactions on Control of Network Systems, 2(3), 278\u2013287.","journal-title":"IEEE Transactions on Control of Network Systems"},{"doi-asserted-by":"publisher","unstructured":"Briglia, E., Alaggia, S., & Paganini, F. (2017). Distribution network management based on optimal power flow: Integration of discrete decision variables. In 2017 51st annual conference on information sciences and systems (CISS) (pp. 1\u20136). https:\/\/doi.org\/10.1109\/CISS.2017.7926079","key":"5054_CR10","DOI":"10.1109\/CISS.2017.7926079"},{"doi-asserted-by":"crossref","unstructured":"Calinescu, G., Chakrabarti, A., Karloff, H., & Rabani, Y. (2002). Improved approximation algorithms for resource allocation. In International conference on integer programming and combinatorial optimization (pp. 401\u2013414). Springer.","key":"5054_CR11","DOI":"10.1007\/3-540-47867-1_28"},{"unstructured":"Carpentier, J. (1962). Contribution a l\u2019etude du dispatching economique. Bulletin de la Societe Francaise des Electriciens, 3(1), 431\u2013447.","key":"5054_CR12"},{"issue":"1","key":"5054_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00453-006-1210-5","volume":"47","author":"A Chakrabarti","year":"2007","unstructured":"Chakrabarti, A., Chekuri, C., Gupta, A., & Kumar, A. (2007). Approximation algorithms for the unsplittable flow problem. Algorithmica, 47(1), 53\u201378.","journal-title":"Algorithmica"},{"doi-asserted-by":"publisher","unstructured":"Chapman, A. C., Verbi\u010d, G., & Hill, D. J. (2013). A healthy dose of reality for game-theoretic approaches to residential demand response. In 2013 IREP symposium bulk power system dynamics and control\u2014IX optimization, security and control of the emerging power grid (pp. 1\u201313). https:\/\/doi.org\/10.1109\/IREP.2013.6629395","key":"5054_CR14","DOI":"10.1109\/IREP.2013.6629395"},{"doi-asserted-by":"publisher","unstructured":"Chau, S. C. K., Elbassioni, K., & Khonji, M. (2018). Combinatorial optimization of alternating current electric power systems. https:\/\/doi.org\/10.1561\/3100000017","key":"5054_CR15","DOI":"10.1561\/3100000017"},{"issue":"3","key":"5054_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1273340.1273343","volume":"3","author":"C Chekuri","year":"2007","unstructured":"Chekuri, C., Mydlarz, M., & Shepherd, F. B. (2007). Multicommodity demand flow in a tree and packing integer programs. ACM Transactions on Algorithms (TALG), 3(3), 27.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"issue":"4","key":"5054_CR17","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s00453-011-9502-9","volume":"63","author":"M Chrobak","year":"2012","unstructured":"Chrobak, M., Woeginger, G. J., Makino, K., & Xu, H. (2012). Caching is hard-even in the fault model. Algorithmica, 63(4), 781\u2013794.","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Cook, D., Faber, V., Marathe, M., Srinivasan, A., & Sussmann, Y. J. (1998). Low-bandwidth routing and electrical power networks. In International colloquium on automata, languages, and programming (pp. 604\u2013615) Springer.","key":"5054_CR18","DOI":"10.1007\/BFb0055088"},{"issue":"1","key":"5054_CR19","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-018-3111-9","volume":"279","author":"K Elbassioni","year":"2019","unstructured":"Elbassioni, K., Karapetyan, A., & Nguyen, T. T. (2019). Approximation schemes for R-weighted minimization knapsack problems. Annals of Operations Research, 279(1), 367\u2013386.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"5054_CR20","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1109\/TPWRS.2013.2255317","volume":"28","author":"M Farivar","year":"2013","unstructured":"Farivar, M., & Low, S. H. (2013). Branch flow model: Relaxations and convexification-part i. IEEE Transactions on Power Systems, 28(3), 2554\u20132564.","journal-title":"IEEE Transactions on Power Systems"},{"issue":"3","key":"5054_CR21","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s12667-012-0056-y","volume":"3","author":"S Frank","year":"2012","unstructured":"Frank, S., Steponavice, I., & Rebennack, S. (2012). Optimal power flow: A bibliographic survey i. Energy Systems, 3(3), 221\u2013258.","journal-title":"Energy Systems"},{"issue":"1","key":"5054_CR22","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/TAC.2014.2332712","volume":"60","author":"L Gan","year":"2015","unstructured":"Gan, L., Li, N., Topcu, U., & Low, S. H. (2015). Exact convex relaxation of optimal power flow in radial networks. IEEE Transactions on Automatic Control, 60(1), 72\u201387.","journal-title":"IEEE Transactions on Automatic Control"},{"doi-asserted-by":"crossref","unstructured":"Grandoni, F., M\u00f6mke, T., & Wiese, A. (2022a). A PTAS for unsplittable flow on a path. In Proceedings of the 54th annual ACM SIGACT symposium on theory of computing (pp. 289\u2013302). Association for Computing Machinery, New York, NY, USA, STOC 2022.","key":"5054_CR23","DOI":"10.1145\/3519935.3519959"},{"doi-asserted-by":"publisher","unstructured":"Grandoni, F., M\u00f6mke, T., & Wiese, A. (2022b). Unsplittable flow on a path: The game! In Proceedings of the 2022 annual ACM-SIAM symposium on discrete algorithms (SODA) (pp. 906\u2013926). https:\/\/doi.org\/10.1137\/1.9781611977073.39","key":"5054_CR24","DOI":"10.1137\/1.9781611977073.39"},{"doi-asserted-by":"crossref","unstructured":"Grandoni, F., Momke, T., Wiese, A., & Zhou, H. (2018). A (5\/3+ $$\\varepsilon $$)-approximation for unsplittable flow on a path: Placing small tasks into boxes. In Proceedings of the 50th annual ACM SIGACT symposium on theory of computing (pp. 607\u2013619). ACM.","key":"5054_CR25","DOI":"10.1145\/3188745.3188894"},{"doi-asserted-by":"crossref","unstructured":"Hall, N. G., & Magazine, M. J. (1994). Maximizing the value of a space mission. European Journal of Operational Research, 78(2), 224\u2013241.","key":"5054_CR26","DOI":"10.1016\/0377-2217(94)90385-9"},{"issue":"3","key":"5054_CR27","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s12532-016-0112-z","volume":"9","author":"H Hijazi","year":"2017","unstructured":"Hijazi, H., Coffrin, C., & Hentenryck, P. V. (2017). Convex quadratic relaxations for mixed-integer nonlinear programs in power systems. Mathematical Programming Computation, 9(3), 321\u2013367.","journal-title":"Mathematical Programming Computation"},{"issue":"2","key":"5054_CR28","first-page":"1359","volume":"32","author":"S Huang","year":"2017","unstructured":"Huang, S., Wu, Q., Wang, J., & Zhao, H. (2017). A sufficient condition on convex relaxation of ac optimal power flow in distribution networks. IEEE Transactions on Power Systems, 32(2), 1359\u20131368.","journal-title":"IEEE Transactions on Power Systems"},{"issue":"4","key":"5054_CR29","doi-asserted-by":"publisher","first-page":"2714","DOI":"10.1109\/TSG.2016.2616945","volume":"9","author":"A Karapetyan","year":"2018","unstructured":"Karapetyan, A., Khonji, M., Chau, C., Elbassioni, K., & Zeineldin, H. H. (2018). Efficient algorithm for scalable event-based demand response management in microgrids. IEEE Transactions on Smart Grid, 9(4), 2714\u20132725. https:\/\/doi.org\/10.1109\/TSG.2016.2616945","journal-title":"IEEE Transactions on Smart Grid"},{"doi-asserted-by":"publisher","unstructured":"Karapetyan, A., Khonji, M., Chau, S. C. K., Elbassioni, K., Zeineldin, H., EL-Fouly, T. H. M., & Al-Durra A. (2021). A competitive scheduling algorithm for online demand response in islanded microgrids. IEEE Transactions on Power Systems, 36(4), 3430\u20133440. https:\/\/doi.org\/10.1109\/TPWRS.2020.3046144","key":"5054_CR30","DOI":"10.1109\/TPWRS.2020.3046144"},{"issue":"1","key":"5054_CR31","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/TCNS.2016.2622362","volume":"5","author":"M Khonji","year":"2018","unstructured":"Khonji, M., Chau, C. K., & Elbassioni, K. (2018). Optimal power flow with inelastic demands for demand response in radial distribution networks. IEEE Transactions on Control of Network Systems, 5(1), 513\u2013524.","journal-title":"IEEE Transactions on Control of Network Systems"},{"issue":"2","key":"5054_CR32","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1109\/TCNS.2019.2951657","volume":"7","author":"M Khonji","year":"2020","unstructured":"Khonji, M., Chau, S. C., & Elbassioni, K. (2020). Combinatorial optimization of ac optimal power flow with discrete demands in radial networks. IEEE Transactions on Control of Network Systems, 7(2), 887\u2013898. https:\/\/doi.org\/10.1109\/TCNS.2019.2951657","journal-title":"IEEE Transactions on Control of Network Systems"},{"key":"5054_CR33","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2018.08.023","volume":"761","author":"M Khonji","year":"2019","unstructured":"Khonji, M., Karapetyan, A., Elbassioni, K., & Chau, S. C. K. (2019). Complex-demand scheduling problem with application in smart grid. Theoretical Computer Science, 761, 34\u201350.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"5054_CR34","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1137\/S0097539799355314","volume":"31","author":"SG Kolliopoulos","year":"2001","unstructured":"Kolliopoulos, S. G., & Stein, C. (2001). Approximation algorithms for single-source unsplittable flow. SIAM Journal on Computing, 31(3), 919\u2013946.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"5054_CR35","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1109\/TPWRD.2004.835432","volume":"19","author":"PN Korovesis","year":"2004","unstructured":"Korovesis, P. N., Vokas, G. A., Gonos, I. F., & Topalis, F. V. (2004). Influence of large-scale installation of energy saving lamps on the line voltage distortion of a weak network supplied by photovoltaic station. IEEE Transactions on Power Delivery, 19(4), 1787\u20131793.","journal-title":"IEEE Transactions on Power Delivery"},{"doi-asserted-by":"publisher","unstructured":"Lin, C., & Lin, S. (2008). Distributed optimal power flow with discrete control variables of large distributed power systems. IEEE Transactions on Power Systems, 23(3), 1383\u20131392. https:\/\/doi.org\/10.1109\/TPWRS.2008.926695","key":"5054_CR36","DOI":"10.1109\/TPWRS.2008.926695"},{"issue":"1","key":"5054_CR37","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/TCNS.2014.2309732","volume":"1","author":"SH Low","year":"2014","unstructured":"Low, S. H. (2014). Convex relaxation of optimal power flow-Part I: Formulations and equivalence. IEEE Transactions on Control of Network Systems, 1(1), 15\u201327.","journal-title":"IEEE Transactions on Control of Network Systems"},{"issue":"2","key":"5054_CR38","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1109\/TCNS.2014.2323634","volume":"1","author":"SH Low","year":"2014","unstructured":"Low, S. H. (2014). Convex relaxation of optimal power flow-Part II: Exactness. IEEE Transactions on Control of Network Systems, 1(2), 177\u2013189.","journal-title":"IEEE Transactions on Control of Network Systems"},{"issue":"4","key":"5054_CR39","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1109\/TSG.2016.2536740","volume":"7","author":"S Mhanna","year":"2016","unstructured":"Mhanna, S., Chapman, A. C., & Verbi\u010d, G. (2016). A fast distributed algorithm for large-scale demand response aggregation. IEEE Transactions on Smart Grid, 7(4), 2094\u20132107. https:\/\/doi.org\/10.1109\/TSG.2016.2536740","journal-title":"IEEE Transactions on Smart Grid"},{"doi-asserted-by":"crossref","unstructured":"Momke, T., & Wiese, A. (2015). A (2+ epsilon)-approximation algorithm for the storage allocation. In 42nd International colloquium on automata, languages, and programming (pp. 973\u2013984). Springer.","key":"5054_CR40","DOI":"10.1007\/978-3-662-47672-7_79"},{"issue":"6","key":"5054_CR41","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1002\/1099-1425(200011\/12)3:6<365::AID-JOS56>3.0.CO;2-P","volume":"3","author":"CA Phillips","year":"2000","unstructured":"Phillips, C. A., Uma, R., & Wein, J. (2000). Off-line admission control for general scheduling problems. Journal of Scheduling, 3(6), 365\u2013381.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"5054_CR42","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P Raghavan","year":"1987","unstructured":"Raghavan, P., & Tompson, C. D. (1987). Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4), 365\u2013374.","journal-title":"Combinatorica"},{"issue":"2","key":"5054_CR43","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1137\/S0097539796314240","volume":"29","author":"A Srinivasan","year":"1999","unstructured":"Srinivasan, A. (1999). Improved approximation guarantees for packing and covering integer programs. SIAM Journal on Computing, 29(2), 648\u2013670.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"5054_CR44","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1109\/TPWRS.2012.2208205","volume":"28","author":"B Zhang","year":"2013","unstructured":"Zhang, B., & Tse, D. (2013). Geometry of injection regions of power networks. IEEE Transactions on Power Systems, 28(2), 788\u2013797. https:\/\/doi.org\/10.1109\/TPWRS.2012.2208205","journal-title":"IEEE Transactions on Power Systems"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-05054-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-05054-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-05054-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T17:37:33Z","timestamp":1673372253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-05054-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["5054"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-05054-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"25 October 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}