Abstract
In this paper, we study the online multidimensional knapsack problem (called OMdKP) in which there is a knapsack whose capacity is represented in m dimensions, each dimension could have a different capacity. Then, n items with different scalar profit values and m-dimensional weights arrive in an online manner and the goal is to admit or decline items upon their arrival such that the total profit obtained by admitted items is maximized and the capacity of knapsack across all dimensions is respected. This is a natural generalization of the classic single-dimension knapsack problem and finds several relevant applications such as in virtual machine allocation, job scheduling, and all-or-nothing flow maximization over a graph. We develop two algorithms for OMdKP that use linear and exponential reservation functions to make online admission decisions. Our competitive analysis shows that the linear and exponential algorithms achieve the competitive ratios of O(θα ) and O(łogł(θα)), respectively, where α is the ratio between the aggregate knapsack capacity and the minimum capacity over a single dimension and θ is the ratio between the maximum and minimum item unit values. We also characterize a lower bound for the competitive ratio of any online algorithm solving OMdKP and show that the competitive ratio of our algorithm with exponential reservation function matches the lower bound up to a constant factor.
- Bahram Alinia, Mohammad H Hajiesmaili, and Noël Crespi. 2019. Online EV charging scheduling with on-arrival commitment. IEEE Transactions on Intelligent Transportation Systems 20, 12 (2019), 4524--4537.Google Scholar
Digital Library
- Bahram Alinia, Mohammad H Hajiesmaili, Zachary J Lee, Noel Crespi, and Enrique Mallada. 2020. Online EV scheduling algorithms for adaptive charging networks with global peak constraints. IEEE Transactions on Sustainable Computing (2020).Google Scholar
Cross Ref
- Bahram Alinia, Mohammad Sadegh Talebi, Mohammad H Hajiesmaili, Ali Yekkehkhany, and Noel Crespi. 2018. Competitive online scheduling algorithms with applications in deadline-constrained EV charging. In 2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS). IEEE, 1--10.Google Scholar
Cross Ref
- Yossi Azar, Joan Boyar, Lene M Favrholdt, Kim S Larsen, Morten N Nielsen, and Leah Epstein. 2002. Fair versus unrestricted bin packing. Algorithmica 34, 2 (2002), 181--196.Google Scholar
Digital Library
- Yossi Azar, Niv Buchbinder, TH Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, et al. 2016. Online algorithms for covering and packing problems with convex objectives. In Proc. of FOCS. 148--157.Google Scholar
Cross Ref
- János Balogh, József Békési, György Dósa, Leah Epstein, and Asaf Levin. 2021. A new lower bound for classic online bin packing. Algorithmica (2021), 1--16. Proc. ACM Meas. Anal. Comput. Syst., Vol. 5, No. 3, Article 30. Publication date: December 2021. 30:22 Lin Yang et al.Google Scholar
- Santiago Balseiro, Haihao Lu, and Vahab Mirrokni. 2020. The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems. arXiv preprint arXiv:2011.10124 (2020).Google Scholar
- Allan Borodin and Ran El-Yaniv. 2005. Online computation and competitive analysis. Cambridge University Press.Google Scholar
Digital Library
- Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, and Philippe Michelon. 2010. A multi-level search strategy for the 0--1 Multidimensional Knapsack Problem. Discrete Applied Mathematics 158, 2 (2010), 97 -- 109. https://doi.org/10.1016/j.dam.2009.08.007Google Scholar
Digital Library
- Joan Boyar, Lene M Favrholdt, Kim S Larsen, and Morten N Nielsen. 2001. The competitive ratio for on-line dual bin packing with restricted input sequences. Nordic Journal of Computing 8, 4 (2001), 463--472.Google Scholar
Digital Library
- Niv Buchbinder and Joseph Naor. 2009. The design of competitive online algorithms via a primal-dual approach. Now Publishers Inc.Google Scholar
Digital Library
- Niv Buchbinder and Joseph Naor. 2009. Online primal-dual algorithms for covering and packing. Mathematics of Operations Research 34, 2 (2009), 270--286.Google Scholar
Digital Library
- Hans-Joachim Böckenhauer, Dennis Komm, Richard Královi?, and Peter Rossmanith. 2014. The online knapsack problem: Advice and randomization. Theoretical Computer Science 527 (2014), 61 -- 72. https://doi.org/10.1016/j.tcs. 2014.01.027Google Scholar
Cross Ref
- Ying Cao, Bo Sun, and Danny HK Tsang. 2020. Optimal Online Algorithms for One-Way Trading and Online Knapsack Problems: A Unified Competitive Analysis. In Proc. of IEEE Conference on Decision and Control (CDC). 1064--1069.Google Scholar
Digital Library
- Deeparnab Chakrabarty, Yunhong Zhou, and Rajan Lukose. 2008. Online knapsack problems. In Workshop on internet and network economics (WINE).Google Scholar
- Chandra Chekuri and Sanjeev Khanna. 1999. On multi-dimensional packing problems. In Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms. Citeseer, 185--194.Google Scholar
Digital Library
- Chandra Chekuri, Sanjeev Khanna, and F Bruce Shepherd. 2004. The all-or-nothing multicommodity flow problem. In Proc. of ACM STOC. 156--165.Google Scholar
Digital Library
- Francis YL Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang, Guohui Lin, Hing-Fung Ting, Luping Zhang, Yong Zhang, et al. 2015. Competitive algorithms for unbounded one-way trading. Theoretical Computer Science 607 (2015), 35--48.Google Scholar
Digital Library
- Henrik I Christensen, Arindam Khan, Sebastian Pokutta, and Prasad Tetali. 2017. Approximation and online algorithms for multidimensional bin packing: A survey. Computer Science Review 24 (2017), 63--79.Google Scholar
Cross Ref
- Marek Cygan, and Jií Sgall. 2016. Online knapsack revisited. Theory of Computing Systems 58, 1 (2016), 153--190.Google Scholar
Digital Library
- Ran El-Yaniv, Amos Fiat, Richard M Karp, and Gordon Turpin. 2001. Optimal search and one-way trading online algorithms. Algorithmica 30, 1 (2001), 101--139.Google Scholar
Cross Ref
- Arnaud Fréville and SaÏd Hanafi. 2005. The multidimensional 0--1 knapsack problem-bounds and computational aspects. Annals of Operations Research 139, 1 (2005), 195.Google Scholar
Cross Ref
- Arnaud Fréville. 2004. The multidimensional 0--1 knapsack problem: An overview. European Journal of Operational Research 155, 1 (2004), 1 -- 21. https://doi.org/10.1016/S0377--2217(03)00274--1Google Scholar
Cross Ref
- Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, and Andreas Wiese. 2017. Approximating geometric knapsack via L-packings. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 260--271.Google Scholar
Cross Ref
- Rainer Gawlick, Anil Kamath, Serge Plotkin, and KG Ramakrishnan. 1995. Routing and Admission Control of Virtual Circuits in General Topology Networks. (1995).Google Scholar
- Glauco Estácio Gonçalves, Patricia Takako Endo, Moises Rodrigues, Djamel H Sadok, Judith Kelner, and Calin Curescu. 2020. Resource allocation based on redundancy models for high availability cloud. Computing 102, 1 (2020), 43--63.Google Scholar
Digital Library
- Naman Govil, Rahul Shrestha, and Shubhajit Roy Chowdhury. 2017. PGMA: an algorithmic approach for multi-objective hardware software partitioning. Microprocessors and Microsystems 54 (2017), 83--96.Google Scholar
Digital Library
- Xin Han and Kazuhisa Makino. 2010. Online removable knapsack with limited cuts. Theoretical Computer Science 411, 44 (2010), 3956 -- 3964. https://doi.org/10.1016/j.tcs.2010.08.009Google Scholar
Cross Ref
- Mhand Hifi, Mustapha Michrafy, and Abdelkader Sbihi. 2004. Heuristic algorithms for the multiple-choice multidimensional knapsack problem. Journal of the Operational Research Society 55, 12 (2004), 1323--1332.Google Scholar
Cross Ref
- Dinh Thai Hoang, Dusit Niyato, and Ping Wang. 2012. Optimal admission control policy for mobile cloud computing hotspot with cloudlet. In 2012 IEEE wireless communications and networking conference (WCNC). IEEE, 3145--3149.Google Scholar
- Kazuo Iwama and Shiro Taketomi. 2002. Removable online knapsack problems. In International Colloquium on Automata, Languages, and Programming. Springer, 293--305.Google Scholar
- David S Johnson. 1973. Near-optimal bin packing algorithms. Ph.D. Dissertation. Massachusetts Institute of Technology.Google Scholar
- Russell Lee, Jessica Maghakian, Mohammad Hajiesmaili, Jian Li, Ramesh Sitaraman, and Zhenhua Liu. 2021. Online Peak-Aware Energy Scheduling with Untrusted Advice. In Proceedings of the Twelfth ACM International Conference on Future Energy Systems (ACM eEnergy). 17. Proc. ACM Meas. Anal. Comput. Syst., Vol. 5, No. 3, Article 30. Publication date: December 2021. Competitive Algorithms for Online Multidimensional Knapsack Problems 30:23Google Scholar
Digital Library
- Jérémie Leguay, Lorenzo Maggi, Moez Draief, Stefano Paris, and Symeon Chouvardas. 2016. Admission control with online algorithms in SDN. In NOMS 2016--2016 IEEE/IFIP Network Operations and Management Symposium. IEEE, 718--721.Google Scholar
Digital Library
- Brendan Lucier, Ishai Menache, Joseph Naor, and Jonathan Yaniv. 2013. Efficient online scheduling for deadline-sensitive jobs. In Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures. 305--314.Google Scholar
Digital Library
- Thodoris Lykouris and Sergei Vassilvtiskii. 2018. Competitive caching with machine learned advice. In International Conference on Machine Learning. PMLR, 3296--3305.Google Scholar
- Alberto Marchetti-Spaccamela and Carlo Vercellis. 1995. Stochastic on-line knapsack problems. Mathematical Programming 68, 1 (1995), 73--104.Google Scholar
Digital Library
- S. Paris, J. Leguay, L. Maggi, M. Draief, and S. Chouvardas. 2016. Online experts for admission control in SDN. In NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium. 1003--1004.Google Scholar
- Jakob Puchinger, Günther R Raidl, and Ulrich Pferschy. 2010. The multidimensional knapsack problem: Structure and algorithms. INFORMS Journal on Computing 22, 2 (2010), 250--265.Google Scholar
Digital Library
- Manish Purohit, Zoya Svitkina, and Ravi Kumar. 2018. Improving online algorithms via ML predictions. Advances in Neural Information Processing Systems (NeurIPS 31 (2018), 9661--9670.Google Scholar
- Bo Sun, Russell Lee, Mohammad H. Hajiesmaili, Adam Wierman, and Danny Tsang. 2021. Pareto-Optimal LearningAugmented Algorithms for Online Conversion Problems. Advances in Neural Information Processing Systems (NeurIPS) (2021).Google Scholar
- Bo Sun, Tongxin Li, Steven H Low, and Danny HK Tsang. 2020. ORC: An Online Competitive Algorithm for Recommendation and Charging Schedule in Electric Vehicle Charging Network. In Proceedings of the Eleventh ACM International Conference on Future Energy Systems. 144--155.Google Scholar
Digital Library
- Bo Sun, Ali Zeynali, Tongxin Li, Mohammad Hajiesmaili, Adam Wierman, and Danny HK Tsang. 2020. Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging. Proceedings of the ACM on Measurement and Analysis of Computing Systems 4, 3 (2020), 1--32.Google Scholar
Digital Library
- Xiaoqi Tan, Bo Sun, Alberto Leon-Garcia, Yuan Wu, and Danny HK Tsang. 2020. Mechanism design for online resource allocation: A unified approach. Proceedings of the ACM on Measurement and Analysis of Computing Systems 4, 2 (2020), 1--46.Google Scholar
Digital Library
- Alessio Trivella and David Pisinger. 2016. The load-balanced multi-dimensional bin-packing problem. Computers & Operations Research 74 (2016), 152--164.Google Scholar
Digital Library
- Nathaniel Tucker and Mahnoosh Alizadeh. 2019. An online admission control mechanism for electric vehicles at public parking infrastructures. IEEE Transactions on Smart Grid 11, 1 (2019), 161--170.Google Scholar
Cross Ref
- M Jalali Varnamkhasti. 2012. Overview of the algorithms for solving the multidimensional knapsack problems. Advanced Studies in Biology 4, 1 (2012), 37--47.Google Scholar
- Lin Yang, Wing Shing Wong, and Mohammad H Hajiesmaili. 2017. An optimal randomized online algorithm for QoS buffer management. Proceedings of the ACM on Measurement and Analysis of Computing Systems 1, 2 (2017), 1--26.Google Scholar
Digital Library
- Quan Yuan and Zhixin Yang. 2013. An Improved Weight-coded Evolutionary Algorithm for the Multidimensional Knapsack Problem. arXiv preprint arXiv:1302.5374 (2013).Google Scholar
- Ali Zeynali, Bo Sun, Mohammad Hajiesmaili, and Adam Wierman. 2021. Data-driven Competitive Algorithms for Online Knapsack and Set Cover. In Proc. of AAAI.Google Scholar
Cross Ref
- Xiaoxi Zhang, Zhiyi Huang, Chuan Wu, Zongpeng Li, and Francis CM Lau. 2015. Online auctions in IaaS clouds: Welfare and profit maximization with server costs. In Proc. of ACM SIGMETRICS. 3--15.Google Scholar
Digital Library
- Zijun Zhang, Zongpeng Li, and Chuan Wu. 2017. Optimal posted prices for online cloud resource allocation. Proceedings of the ACM on Measurement and Analysis of Computing Systems 1, 1 (2017), 1--26.Google Scholar
Digital Library
- Zizhan Zheng and Ness B Shroff. 2016. Online multi-resource allocation for deadline sensitive jobs with partial values in the cloud. In IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications. IEEE, 1--9.Google Scholar
Digital Library
- Yunhong Zhou, Deeparnab Chakrabarty, and Rajan Lukose. 2008. Budget constrained bidding in keyword auctions and online knapsack problems. In International Workshop on Internet and Network Economics. Springer, 566--576.Google Scholar
Digital Library
Index Terms
Competitive Algorithms for Online Multidimensional Knapsack Problems
Recommendations
Competitive Algorithms for Online Multidimensional Knapsack Problems
SIGMETRICS '22In this work, we study the online multidimensional knapsack problem (called OMdKP) in which there is a knapsack whose capacity is represented in m dimensions, each dimension could have a different capacity. Then, n items with different scalar profit ...
Competitive Algorithms for Online Multidimensional Knapsack Problems
SIGMETRICS/PERFORMANCE '22: Abstract Proceedings of the 2022 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer SystemsIn this work, we study the online multidimensional knapsack problem (called OMdKP) in which there is a knapsack whose capacity is represented in m dimensions, each dimension could have a different capacity. Then, n items with different scalar profit ...
Online removable knapsack with limited cuts
In this paper, we study online maximization and minimization knapsack problems with limited cuts, in which (1) items are given one by one over time, i.e., after a decision is made on the current item, the next one is given, (2) items are allowed to be ...






Comments