{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:58:56Z","timestamp":1725861536516},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_40","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"496-509","source":"Crossref","is-referenced-by-count":4,"title":["Complex-Demand Scheduling Problem with Application in Smart Grid"],"prefix":"10.1007","author":[{"given":"Majid","family":"Khonji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Areg","family":"Karapetyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Elbassioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Kin","family":"Chau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Grandoni, F., Leonardi, S., Wiese, A.: Amazing 2+ $$\\varepsilon $$ approximation for unsplittable flow on a path. In: Proceedings of SODA, pp. 26\u201341. SIAM (2014)","DOI":"10.1137\/1.9781611973402.3"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chakrabarti, A., Epstein, A., Schieber, B.: A quasi-PTAS for unsplittable flow on line graphs. In: Proceedings of STOC, STOC 2006, pp. 721\u2013729. ACM (2006)","DOI":"10.1145\/1132516.1132617"},{"key":"40_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/978-3-662-44777-2_19","volume-title":"Algorithms - ESA 2014","author":"VT Chakaravarthy","year":"2014","unstructured":"Chakaravarthy, V.T., Choudhury, A.R., Gupta, S., Roy, S., Sabharwal, Y.: Improved algorithms for resource allocation under varying capacity. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 222\u2013234. Springer, Heidelberg (2014)"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Chakaravarthy, V.T., Pandit, V., Sabharwal, Y., Seetharam, D.P.: Varying bandwidth resource allocation problem with bag constraints. In: Parallel & Distributed Processing (IPDPS), pp. 1\u201310. IEEE (2010)","DOI":"10.1109\/IPDPS.2010.5470347"},{"issue":"1","key":"40_CR5","doi-asserted-by":"crossref","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.: Approximation algorithms for the unsplittable flow problem. Algorithmica 47(1), 53\u201378 (2007)","journal-title":"Algorithmica"},{"key":"40_CR6","unstructured":"Chau, C.K., Elbassioni, K., Khonji, M.: Truthful mechanisms for combinatorial AC electric power allocation. In: Proceedings of AAMAS (2014). http:\/\/arxiv.org\/abs\/1403.3907"},{"key":"40_CR7","unstructured":"Chau, C.K., Elbassioni, K., Khonji, M.: Truthful mechanisms for combinatorial allocation of electric power in alternating current electric systems for smart grid. ACM Trans. Econ. Comput. (2016). http:\/\/arxiv.org\/abs\/1507.01762"},{"issue":"3","key":"40_CR8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/1273340.1273343","volume":"3","author":"C Chekuri","year":"2007","unstructured":"Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity demand flow in a tree and packing integer programs. ACM Trans. Algorithms (TALG) 3(3), 27 (2007)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"49","key":"40_CR9","doi-asserted-by":"crossref","first-page":"4217","DOI":"10.1016\/j.tcs.2010.08.028","volume":"411","author":"A Darmann","year":"2010","unstructured":"Darmann, A., Pferschy, U., Schauer, J.: Resource allocation with time intervals. Theor. Comput. Sci. 411(49), 4217\u20134234 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"40_CR10","unstructured":"Elbassioni, K., Garg, N., Gupta, D., Kumar, A., Narula, V., Pal, A.: Approximation algorithms for the unsplittable flow problem on paths and trees. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 18 (2012)"},{"key":"40_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-319-23114-3_17","volume-title":"Algorithmic Decision Theory","author":"K Elbassioni","year":"2015","unstructured":"Elbassioni, K., Nguyen, T.T.: Approximation schemes for multi-objective optimization with quadratic constraints of fixed CP-rank. In: Walsh, T. (ed.) ADT 2015. LNCS, vol. 9346, pp. 273\u2013287. Springer, Heidelberg (2015)"},{"issue":"4","key":"40_CR12","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1109\/SURV.2011.101911.00087","volume":"14","author":"X Fang","year":"2012","unstructured":"Fang, X., Misra, S., Xue, G., Yang, D.: Smart grid the new and improved power grid: a survey. IEEE Commun. Surv. Tutorials 14(4), 944\u2013980 (2012)","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"40_CR13","volume-title":"Power System Analysis","author":"J Grainger","year":"1994","unstructured":"Grainger, J., Stevenson, W.: Power System Analysis. McGraw-Hill, New York City (1994)"},{"key":"40_CR14","doi-asserted-by":"publisher","unstructured":"Grandoni, F., Ingala, S., Uniyal, S.: Improved approximation algorithms for unsplittable flow on a path with time windows. In: Sanit\u00e0, L., et al. (eds.) WAOA 2015. LNCS, vol. 9499, pp. 13\u201324. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-28684-6_2","DOI":"10.1007\/978-3-319-28684-6_2"},{"key":"40_CR15","unstructured":"Karapetyan, A., Khonji, M., Chau, C.K., Elbassioni, K., Zeineldin, H.: Efficient algorithm for scalable event-based demand response management in microgrids. Technical report, Masdar Institute (2015)"},{"key":"40_CR16","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2010","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2010)"},{"key":"40_CR17","unstructured":"Khonji, M., Karapetyan, A., Elbassioni, K., Chau, C.K.: Complex-demand scheduling problem with application in smart grid. Technical report, Masdar Institute (2016). http:\/\/arxiv.org\/abs\/1603.01786"},{"key":"40_CR18","unstructured":"Khonji, M., Chau, C.K., Elbassioni, K.: Optimal power flow with inelastic demands for demand response in radial distribution networks. Technical report, Masdar Institute (2016). http:\/\/arxiv.org\/abs\/1507.01762"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Khonji, M., Chau, C.K., Elbassioni, K.M.: Inapproximability of power allocation with inelastic demands in AC electric systems and networks. In: ICCCN, pp. 1\u20136 (2014)","DOI":"10.1109\/ICCCN.2014.6911861"},{"issue":"1","key":"40_CR20","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1017\/S0962492906370018","volume":"17","author":"AS Nemirovski","year":"2008","unstructured":"Nemirovski, A.S., Todd, M.J.: Interior-point methods for optimization. Acta Numerica 17(1), 191\u2013234 (2008)","journal-title":"Acta Numerica"},{"issue":"5","key":"40_CR21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","volume":"2","author":"FC Spieksma","year":"1999","unstructured":"Spieksma, F.C.: On the approximability of an interval scheduling problem. J. Sched. 2(5), 215\u2013227 (1999)","journal-title":"J. Sched."},{"issue":"1","key":"40_CR22","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger, G.J.: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (fptas)? INFORMS J. Comput. 12(1), 57\u201374 (2000)","journal-title":"INFORMS J. Comput."},{"key":"40_CR23","unstructured":"Yu, L., Chau, C.K.: Complex-demand knapsack problems and incentives in AC power systems. In: Proceedings of AAMAS, pp. 973\u2013980. Richland, SC (2013)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T11:04:30Z","timestamp":1568199870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}