CITATIONS

[BBBDT24] János Balogh, József Békési, Nóra Büki, György Dósa, and Zsolt Tuza, Extremal behavior of the Greedy algorithm for a triangle scheduling problem, Computers and Operations Research, 106718, 2024.

1. Qianqian Xue, Research on the Optimization of Enterprise Resource Economic Benefits and Management Costs in Cloud Computing Environment, Applied Mathematics and Nonlinear Sciences Volume 9, Issue 1, 2024. DOI: https://doi.org/10.2478/amns-2024-2913 *

   [BDEJ22] Balogh, J., Dósa, G., Epstein, L., and Jeż, Ł., Lower bounds on the performance of online algorithms for relaxed packing problems, In: Bazgan, C., Fernau, H. (eds.) IWOCA 2022. LNCS, vol. 13270, pp. 101–113. Springer, Cham (2022). DOI: https://doi.org/10.1007/978-3-031-06678-8_8

2. Célia Escribe, Michael Hu, and Retsef Levi, Competitive Algorithms for the Online Minimum Peak Job Scheduling, Operations Research, Volume 73, Issue 1, Pages 408–423. DOI: https://doi.org/10.1287/opre.2021.0080 *
3. Devin Smedira and David Shmoys, Scheduling Appointments Online: The Power of Deferred Decision-Making. International Workshop on Approximation and Online Algorithms, WAOA 2022, Lecture Notes in Computer Science (LNCS,volume 13538), pp. 82–115, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-031-18367-6_5 *

   [BBDEL22] Balogh, J., J. Békési, Gy. Dósa, L. Epstein, and A. Levin, Lower bounds for batched bin packing, Journal of Combinatorial Optimization, 43, 613–629, 2022. DOI: 10.1007/s10878-021-00797-z URL: https://doi.org/10.1007/s10878-021-00797-z

4. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, Theoretical Computer Science, 942, 213-229, 2023. DOI: https://doi.org/10.1016/j.tcs.2022.11.034
5. Leah Epstein, Open-end bin packing: New and old analysis approaches, Discrete Applied Mathematics, 321(15):220-239, 2022. DOI: https://doi.org/10.1016/j.dam.2022.07.003

   [BBDKT22] Balogh J., B. Dávid, M. Krész, Attila Tóth, and László Tóth, A general framework for evaluating driver schedules in public transport, Transport Problems, 17(1), 163-174, 2022. DOI: 10.20858/tp.2022.17.1.14

6. Zsolt Ercsey and Zoltán Kovács, Multicommodity network flow model of a human resource allocation problem considering time periods, Central European Journal of Operations Research, DOI: https://doi.org/10.1007/s10100-023-00868-y in press, 2023+. *

   [BBDEL21] Balogh, J., J. Békési, Gy. Dósa, L. Epstein, and A. Levin, A new lower bound for classic online bin packing, Algorithmica, 83(7), 2047–2062, 2021. DOI: https://doi.org/10.1007/s00453-021-00818

7. Matthias Gehnen and Andreas Usdenski, Online Bin Packing with Item Size Estimates, arXiv:2505.09321v1 [cs.DS], 14 May 2025. DOI: https://doi.org/10.48550/arXiv.2505.09321 *
8. Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, and K. V. N. Sreenivas, Near-optimal Algorithms for Stochastic Online Bin Packing, ACM Transactions on Algorithms, in press, 2025+. ACM Transactions on Algorithms, Volume 21, Issue 2, Article No.: 24, pp. 1-39, 2025. DOI: https://doi.org/10.1145/3728642 *
9. Binqi Zhang, Lu Zhen, Shuaian Wang, and Fajun Yang, Integrating Operations Research into Very Large-Scale Integrated Circuits Placement Design: A Review, Asia-Pacific Journal of Operational Research, 41, No. 06, 2024. DOI: https://doi.org/10.1142/S0217595924500076 *
10. Yaqiao Li, Mahtab Masoori, Lata Narayanan, and Denis Pankratov, Renting Servers for Multi-Parameter Jobs in the Cloud, ICDCN '25: Proceedings of the 26th International Conference on Distributed Computing and Networking, pp. 36-45, 2025. DOI: https://doi.org/10.1145/3700838.3700850 Also in: arXiv:2404.15444 [cs.DS], 23 Apr 2024. https://doi.org/10.48550/arXiv.2404.15444 *
11. Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, and Marc Renault, Online Computation with Untrusted Advice, Journal of Computer and System Sciences, Volume 144, Paper No. 103545, 24 pp., 2024. DOI: https://doi.org/10.1016/j.jcss.2024.103545 *
12. Aseel Ismael Ali, Edward Keedwell, and Ayah Helal, A Differential Pheromone Grouping Ant Colony Optimization Algorithm for the 1-D Bin Packing Problem, GECCO '24: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1463-1469, 2024. DOI: https://doi.org/10.1145/3638529.3654074 *
13. Jörg Reutershan, Christian Rupprecht, and Thomas Rupprecht, Operating room scheduling: knowing and accepting your limits, British Journal of Anaesthesia, 132(6):1334-1335, 2024. DOI: https://doi.org/10.1016/j.bja.2024.03.006 *
14. Bingchen Lin, Jiawei Li, Tianxiang Cui, Huan Jin, Ruibin Bai, Rong Qu, and Jon Garibaldi, A pattern-based algorithm with fuzzy logic bin selector for online bin packing problem, Expert Systems with Applications, Volume 249, Part A, 123515, 2024. DOI: https://doi.org/10.1016/j.eswa.2024.123515 *
15. Leah Epstein, Tighter bounds for the harmonic bin packing algorithm, European Journal of Operational Research, 316(1):72-84, 2024. DOI: https://doi.org/10.1016/j.ejor.2024.01.051
16. Pouria Zamani Nezhad, Online Square Packing with Prediction, MSc Thesis, University of Manitoba, Winnipeg, Manitoba, 2023. URI: http://hdl.handle.net/1993/37888 *
17. Spyros Angelopoulos, Shahin Kamali, and Kimia Shadkami, Online Bin Packing with Predictions, Journal of Artificial Intelligence Research, 78, 1111-1141, 2023. DOI: 10.1613/jair.1.14820 *
18. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, Theoretical Computer Science, 942, 213-229, 2023. DOI: https://doi.org/10.1016/j.tcs.2022.11.034
19. Spyros Angelopoulos, Shahin Kamali, and Kimia Shadkami, Online Bin Packing with Predictions, Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22), pp. 4574-4580, 2022. https://doi.org/10.24963/ijcai.2022/635 *
20. Sizhe Li, Jinghui Xue, Mingming Jin, Kai Wang, and Kun He,  A 4-Space Bounded Approximation Algorithm for Online Bin Packing Problem, In: Zhang, Y., Miao, D., Möhring, R. (eds.), Computing and Combinatorics, COCOON 2022. Lecture Notes in Computer Science, vol. 13595, pp. 394–405, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-031-22105-7_35 *
21. Devin Smedira and David Shmoys, Scheduling Appointments Online: The Power of Deferred Decision-Making. International Workshop on Approximation and Online Algorithms, WAOA 2022, Lecture Notes in Computer Science (LNCS,volume 13538), pp. 82–115, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-031-18367-6_5 * Also in: arXiv:2111.13986 [cs.DS], https://arxiv.org/abs/2111.13986 27 Nov 2021. [ Citation of the arXiv-version of our paper. ] *
22. Asaf Levin, Comparing the costs of Any Fit algorithms for bin packing, Operations Research Letters, 50(6): 646-649, 2022. DOI: https://doi.org/10.1016/j.orl.2022.09.006
23. Leah Epstein, Open-end bin packing: New and old analysis approaches, Discrete Applied Mathematics, 321(15):220-239, 2022. DOI: https://doi.org/10.1016/j.dam.2022.07.003
24. Hua Chen and Guochuan Zhang, A survey on approximation algorithms for one dimensional bin packing, Operations Research Transactions, 26(1): 69-84, 2022. (In Chinese.) DOI: 10.15960/j.cnki.issn.1007-6093.2022.01.005 *
25. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, In: Koenemann J., Peis B. (Eds,), Approximation and Online Algorithms. WAOA 2021. Lecture Notes in Computer Science, Vol. 12982, 117-129, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-92702-8_8 Also in: arXiv:2107.08725 [cs.DS], 19 Jul 2021. https://arxiv.org/abs/2107.08725
26. Lin Yang, Ali Zeynali, Mohammad H. Hajiesmaili, Ramesh K. Sitaraman, and Don Towsley, Competitive Algorithms for Online Multidimensional Knapsack Problems, Proceedings of the ACM on Measurement and Analysis of Computing Systems, Volume 5, Issue 3, 2021. Article No.: 30, pp 1–30. DOI: https://doi.org/10.1145/3491042 URL: https://groups.cs.umass.edu/hajiesmaili/wp-content/uploads/sites/24/2021/11/Sigmetrics_2022_OnlineKnapsack.pdf *
27. Shahin Kamali and Pooya Nikbakht, On the Fault-Tolerant Online Bin Packing Problem, In: D’Angelo G., Michail O. (Eds.), Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2021. Lecture Notes in Computer Science, vol 13084. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-93043-1_1 *
28. Eklavya Sharma, Approximation Algorithms for Geometric Packing Problems, Thesis, Master of Technology (Research), Computer Science and Automation, Indian Institute of Science, Bangalore, India, 2021. *
29. Leah Epstein, On bin packing with clustering and bin packing with delays, Discrete Optimization, Vol. 41, 2021, Paper 100647. https://doi.org/10.1016/j.disopt.2021.100647

    [BEL21] Balogh, J., L. Epstein, and A. Levin, More on ordered open end bin packing, Journal of Scheduling, 24, 589–614, 2021. https://doi.org/10.1007/s10951-021-00709-3 Also in: CoRR, abs/2010.07119, 2020. https://arxiv.org/abs/2010.07119

30. Jörg Reutershan, Christian Rupprecht, and Thomas Rupprecht, Operating room scheduling: knowing and accepting your limits, British Journal of Anaesthesia, 132(6):1334-1335, 2024. DOI: https://doi.org/10.1016/j.bja.2024.03.006 *
31. Leah Epstein, Tighter bounds for the harmonic bin packing algorithm, European Journal of Operational Research, 316(1):72-84, 2024. DOI: https://doi.org/10.1016/j.ejor.2024.01.051
32. Asaf Levin, Comparing the costs of Any Fit algorithms for bin packing, Operations Research Letters, 50(6): 646-649, 2022. DOI: https://doi.org/10.1016/j.orl.2022.09.006
33. Leah Epstein, Open-end bin packing: New and old analysis approaches, Discrete Applied Mathematics, 321(15):220-239, 2022. DOI: https://doi.org/10.1016/j.dam.2022.07.003
34. Ling Gai, Weiwei Zhang, Wenchang Luo, and Yukun Cheng, On Various Open-End Bin Packing Game, In: Du DZ., Du D., Wu C., Xu D. (Eds.), Combinatorial Optimization and Applications, COCOA 2021. Lecture Notes in Computer Science (LNCS), vol. 13135, pp. 86-95, 2021. Springer, Cham. https://doi.org/10.1007/978-3-030-92681-6_8 [ Ref. to the arXiv-version. ] *
35. Leah Epstein and Asaf Levin, A note on a variant of the online open end bin packing problem, Operations Research Letters, 48(6):844-849, 2020. DOI: https://doi.org/10.1016/j.orl.2020.10.006 [ Ref. to the arXiv-version. ]

    [BCEL21] Balogh, J., I.R. Cohen, L. Epstein, and A. Levin, Truly Asymptotic Lower Bounds for Online Vector Bin Packing, Proc. of APPROX/RANDOM 2021), LIPICS, Dagstuhl Publishing, Germany, 2021. Vol. 207., pp. 8:1–8:18. DOI: 10.4230/LIPIcs.APPROX/RANDOM.2021.8 Preliminary version: arXiv:2008.00811, 2020. DOI: https://arxiv.org/abs/2008.00811

36. Yaqiao Li, Mahtab Masoori, Lata Narayanan, and Denis Pankratov, Renting Servers for Multi-Parameter Jobs in the Cloud, ICDCN '25: Proceedings of the 26th International Conference on Distributed Computing and Networking, pp. 36-45, 2025. DOI: https://doi.org/10.1145/3700838.3700850 Also in: arXiv:2404.15444 [cs.DS], 23 Apr 2024. https://doi.org/10.48550/arXiv.2404.15444 *
37. Bengt J. Nilsson and Gordana Vujovic, Online Two-Dimensional Vector Packing With Advice, In: Calamoneri T., Corò F. (Eds.), Algorithms and Complexity CIAC 2021, LNCS, vol. 12701. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-75242-2_27 * Extended version: arXiv:2204.10322 [cs.DS], 15 pages. DOI: https://doi.org/10.48550/arXiv.2204.10322 [ Ref. to the arXiv-version of our paper. ] *

    [BBDEL20] Balogh, J., J. Békési, Gy. Dósa, L. Epstein, and A. Levin, Online Bin Packing with Cardinality Constraints Resolved, Journal of Computer and System Sciences, 112:34-49, 2020. DOI: 10.1016/j.jcss.2020.03.002.

38. Matthias Gehnen and Andreas Usdenski, Online Bin Packing with Item Size Estimates, arXiv:2505.09321v1 [cs.DS], 14 May 2025. DOI: https://doi.org/10.48550/arXiv.2505.09321 *
39. Mohsen Abdolhosseinzadeh, Mehdi Djahangiri, and Mir Mohammad Alipour, Local and global information in online stochastic shortest path problem and competitive analysis, Journal of Information and Optimization Sciences, Pages 1-17, 2025+, in press. DOI: https://doi.org/10.47974/JIOS-1584 *
40. Bingchen Lin, Jiawei Li, Tianxiang Cui, Huan Jin, Ruibin Bai, Rong Qu, and Jon Garibaldi, A pattern-based algorithm with fuzzy logic bin selector for online bin packing problem, Expert Systems with Applications, Volume 249, Part A, 123515, 2024. DOI: https://doi.org/10.1016/j.eswa.2024.123515 * [ The arXiv-version of our paper is referenced. ] *
41. Ali Fattahi, Saeed Ghodsi, Sriram Dasu, and Reza Ahmadi, Flattening Energy-Consumption Curves by Monthly Constrained Direct Load Control Contracts, Operations Research, Operations Research, Vol. 72, No. 2, 570–590. DOI: https://doi.org/10.1287/opre.2021.0638 *
42. G. Jaykrishnan and Asaf Levin, EPTAS for the Dual of Splittable Bin Packing with Cardinality Constraint, Theoretical Computer Science, Volume 979, 114202, 2023. https://doi.org/10.1016/j.tcs.2023.114202 Also in: arXiv:2204.04685 [cs.DS], 10 Apr 2022. URL: https://doi.org/10.48550/arXiv.2204.04685
43. Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder, Online cardinality constrained scheduling, Operations Research Letters, 51(5), 533-539, 2023. DOI: https://doi.org/10.1016/j.orl.2023.08.003 /li>
44. Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder, Cardinality Constrained Scheduling in Online Models, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), 219, 28:1--28:15, 2022. Leibniz International Proceedings in Informatics, LIPIcs, URL: https://drops.dagstuhl.de/opus/volltexte/2022/15838, DOI: 10.4230/LIPIcs.STACS.2022.28 Also in: Cardinality Constrained Scheduling in Online Models, arXiv:2201.05113 [cs.DS], 13 Jan 2022. https://arxiv.org/abs/2201.05113
45. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, Theoretical Computer Science, 942, 213-229, 2023. DOI: https://doi.org/10.1016/j.tcs.2022.11.034
46. Salma Mezghani, Boukthir Haddar, and Habib Chabchoub, The evolution of rectangular bin packing problem — A review of research topics, applications, and cited papers, Journal of Industrial and Management Optimization, 19(5):3329-3361, 2023. DOI: 10.3934/jimo.2022088 URL: https://www.aimsciences.org/article/doi/10.3934/jimo.2022088 *
47. Saeed Ghodsi, Data-Driven Decision-Making Under Uncertainty with Applications in Healthcare and Energy Management, PhD Thesis, Advisor: Ahmadi, Reza H., eScholarship.org, UCLA, UCLA Electronic Theses and Dissertations, 2022. URL: https://escholarship.org/uc/item/42s215rn *
48. Borja Ena, Alberto Gomez, Borja Ponte, Paolo Priore, and Diego Diaz, Homogeneous grouping of non-prime steel products for online auctions: a case study Annals of Operations Research, 315, 591–621, 2022. DOI: https://doi.org/10.1007/s10479-022-04677-5 *
49. Ali Fattahi, Saeed Ghodsi, Sriram Dasu, and Reza Ahmadi, Flattening Energy-Consumption Curves by Monthly Constrained Direct Load Control Contracts, URL: https://www.marshall.usc.edu/sites/default/files/dasu/intellcont/Flattening%20the%20energy%20consumption%20curves-1.pdf *
50. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, In: Koenemann J., Peis B. (Eds,), Approximation and Online Algorithms. WAOA 2021. Lecture Notes in Computer Science, Vol. 12982, 117-129, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-92702-8_8 Also in: arXiv:2107.08725 [cs.DS], 19 Jul 2021. https://arxiv.org/abs/2107.08725
51. Alexandra Anna Lassota, Parameterized Algorithms for Integer Linear Programs and Their Applications for Allocation Problems, Dissertation zur Erlangung des akademischen Grades Doktor der Naturwissenschaften (Dr. rer. nat.), Christian-Albrechts-Universität zu Kiel, 2021. Thesis advisor: Prof. Dr. Klaus Jansen. https://macau.uni-kiel.de/receive/macau_mods_00001499?lang=en https://macau.uni-kiel.de/servlets/MCRFileNodeServlet/macau_derivate_00002558/DissertationLassota.pdf *
52. Jorge Herrera-Franklin, Alejandro Rosete-Suárez, Milton García-Borroto, Suitberto Cabrera-García, Influencia de distribuciones estadísticas en la complejidad de instancias del problema de empaquetamiento con tamaño y costo // variable Influence of statistical distributions in the hardness of instances of the variable size and cost bin packing problem, Ingeniería Mecánica, 23(2):e605, 2020. ISSN 1815-5944. (in Spanish) https://ingenieriamecanica.cujae.edu.cu/index.php/revistaim/article/view/634 *

    [BBDIT20] János Balogh, Cosmin Bonchiş, Diana Diniş, Gabriel Istrate, and Ioan Todinca, On the heapability of finite partial orders, Discrete Mathematics & Theoretical Computer Science (DMTCS), vol. 22, no. 1, 2020, #17. https://dmtcs.episciences.org/6540 Also in: arXiv preprint, arXiv:1706.01230 https://doi.org/10.48550/arXiv.1706.01230

53. Gabriel Istrate, A Language-Theoretic Approach to the Heapability of Signed Permutations, arXiv:2405.14275 [math.CO] Thu, 23 May. DOI: https://doi.org/10.48550/arXiv.2405.14275
54. Benjamin Chen, Michael Cho, Mario Tutuncu-Macias, and Tony Tzolov, Efficient methods of calculating the number of heapable permutations, Discrete Applied Mathematics 331, 126-137. https://doi.org/10.1016/j.dam.2023.01.025 *
55. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young‑San Lin, and Minshen Zhu, The Maximum Binary Tree Problem, Algorithmica, 83, 2427–2468, 2021. https://doi.org/10.1007/s00453-021-00836-5
56. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin and Minshen Zhu, The Maximum Binary Tree Problem, 28th Annual European Symposium on Algorithms (ESA 2020), pp. 30:1--30:22, volume 173, (Eds., Fabrizio Grandoni and Grzegorz Herman and Peter Sanders), Dagstuhl, Germany, URL: https://drops.dagstuhl.de/opus/volltexte/2020/12896, DOI: 10.4230/LIPIcs.ESA.2020.30
57. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, and Minshen Zhu, Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), pp. 7:1--7:16, LIPIcs, vol. 2020, (Eds., Yixin Cao and Marcin Pilipczuk), Dagstuhl, Germany, URL: https://drops.dagstuhl.de/opus/volltexte/2020/13310, DOI: 10.4230/LIPIcs.IPEC.2020.7 Its full, ArXiv-version: https://arxiv.org/pdf/2110.00495.pdf
58. Lucas Gerin. Percolation, permutations, particules en interaction. Probabilités [math.PR]. Paris Saclay, 2018. HAL Id: tel-01838158 URL: https://tel.archives-ouvertes.fr/tel-01838158v1 [Ref. to the earlier arXiv-version of our paper: https://arxiv.org/abs/1706.01230v1] *
59. Cosmin Bonchiş, Gabriel Istrate, and Vlad Rochian, The Language (and Series) of Hammersley-Type Processes, In: Durand-Lose, J., Verlan, S. (Eds.), Machines, Computations, and Universality. MCU 2018. Lecture Notes in Computer Science, vol 10881, pp. 69–87. Springer, Cham. DOI: https://doi.org/10.1007/978-3-319-92402-1_4 [ Ref. to the arXiv-version of our paper. ]

    [BBDEL20-19] Balogh, J., J. Békési, Gy. Dósa, L. Epstein, and A. Levin, A new lower bound for classic online bin packing, In: E. Bampis and N. Megow (Eds.): WAOA 2019, LNCS 11926, pp. 18–28, 2020. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-39479-0_2 (Also in: CoRR, abs/1807.05554, arXiv preprint arXiv:1807.05554, 2018.)

60. Anish Hebbar, Arindam Khan, and K. V. N. Sreenivas, Bin Packing under Random-Order: Breaking the Barrier of 3/2, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 4177-4219, 2024. DOI: 10.1137/1.9781611977912.145, URL: https://epubs.siam.org/doi/abs/10.1137/1.9781611977912.145, eprint: {https://epubs.siam.org/doi/pdf/10.1137/1.9781611977912.145 *
61. Célia Escribe, Michael Hu, and Retsef Levi, Competitive Algorithms for the Online Minimum Peak Job Scheduling, Operations Research, Volume 73, Issue 1, Pages 408–423. DOI: https://doi.org/10.1287/opre.2021.0080 * Also in: Competitive Algorithms for the Online Minimum Peak Appointment Scheduling (February 17, 2021). Available at SSRN: https://ssrn.com/abstract=3787306 or http://dx.doi.org/10.2139/ssrn.3787306 *
62. Békési József, Hozzájárulás kombinatorikus optimalizálási problémák egy osztályához = Contribution to a Class of Combinatorial Optimization Problems. Hozzájárulás kombinatorikus optimalizálási problémák egy osztályához, Doktori értekezes tézisei, Akadémiai nagydoktori thesis, Szegedi Tudományegyetem, 2023. URL: http://real-d.mtak.hu/id/eprint/1496
63. Leah Epstein and Loay Mualem,  Online Bin Packing of Squares and Cubes, Algorithmica, 85, 1415–1458, 2023. DOI: https://doi.org/10.1007/s00453-022-01078-9 URL: https://link.springer.com/article/10.1007/s00453-022-01078-9
64. Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, and Arne Schmidt, Parallel Online Algorithms for the Bin Packing Problem, Algorithmica, 85, 296–323, 2023. https://doi.org/10.1007/s00453-022-01030-x
65. Marin Bougeret, György Dósa, Noam Goldberg, and Michael Poss, Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty SIAM Journal on Discrete Mathematics, 36(4):2534-2552, 2022. DOI: 10.1137/21M1457199 URL: https://doi.org/10.1137/21M1457199 Also in: hal-02119351v3, 2020. HAL Id: hal-02119351, https://hal.archives-ouvertes.fr/hal-02119351v3 Preprint submitted on 30 Oct 2020.
66. Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, and K.V.N. Sreenivas, Near-Optimal Algorithms for Stochastic Online Bin Packing, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Editors: Mikołaj Bojańczyk, Emanuela Merelli, and David P. Woodruff; Article No. 12; pp. 12:1–12:20, LIPIcs, Dagstuhl Publishing, Germany. DOI: 10.4230/LIPIcs.ICALP.2022.12 URL: https://drops.dagstuhl.de/opus/volltexte/2022/16353/ * Also in: arXiv:2205.03622v1 [cs.DS], 7 May 2022, URL: https://arxiv.org/pdf/2205.03622.pdf *
67. Shahin Kamali and Pooya Nikbakht, Online Square Packing With Rotation, Proceedings of the 34th Canadian Conference on Computational Geometry, CCCG 2022, pp. 189-197, 2022. (Toronto, 25 August 2022 through 27 August 2022.) https://www.scopus.com/inward/record.uri?eid=2-s2.0-85173819585&partnerID=40&md5=b60d0948fe8b6dccbc0f4c1b22d1de3 * Also in: URL: https://iccg2022.ce.sharif.edu/files/Papers/6-Online-Square-Packing-With-Rotation.pdf *
68. О.В. Ковальов, Information Technology for Adaptation of Heuristic Algorithms for Optimal Packing of Objects into Containers (Інформаційна технологія адаптації евристичних алгоритмів оптимального пакування об'єктів в контейнери), КВАЛІФІКАЦІЙНА МАГІСТЕРСЬКА РОБОТА, Masters thesis, 68 pages, 2021, SumDU Repository, Sumy State University, Ukraine. URL: https://essuir.sumdu.edu.ua/handle/123456789/86860 *
69. Célia Escribe, Reducing Physician Burnout and Costs in Outpatient Healthcare Settings via Advanced Analytics MSc Thesis, Massachusetts Institute of Technology, Operations Research Center. 2021. URI: https://hdl.handle.net/1721.1/139300 *
70. Pooya Nikbakht, Applications and Extensions of The Bin Packing Problem, MSc-Thesis, University of Manitoba, Winnipeg, Manitoba, Canada. 2021. URI: http://hdl.handle.net/1993/36164 *
71. Leah Epstein and Loay Mualem, Online Bin Packing of Squares and Cubes, In: Lubiw A., Salavatipour M. (Eds.), Algorithms and Data Structures, WADS 2021. Lecture Notes in Computer Science, vol. 12808, 2021. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-83508-8_26
72. Shahin Kamali and Pooya Nikbakht, On the Fault-Tolerant Online Bin Packing Problem, arXiv:2107.02922 [cs.DS], 6 Jul 2021. URL: https://arxiv.org/abs/2107.02922 *
73. Susanne Albers, Arindam Khan, and Leon Ladewig, Best Fit Bin Packing with Random Order Revisited, Algorithmica, 83, 2833–2858, 2021. DOI: https://doi.org/10.1007/s00453-021-00844-5 *
74. Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, and Joseph (Seffi) Naor, Online Virtual Machine Allocation with Lifetime and Load Predictions, https://www.microsoft.com/en-us/research/publication/online-virtual-machine-allocation-with-lifetime-and-load-predictions/ https://www.microsoft.com/en-us/research/uploads/prod/2021/01/Online_Virtual_Machine_Allocation_with_Lifetime_and_Load_Predictions.pdf *
75. Bakhthemmat, A. and Izadi, M., Solving fully dynamic bin packing problem for virtual machine allocation in the cloud environment by the futuristic greedy algorithm, Journal of Intelligent and Fuzzy Systems, 40(3):4737-4760, 2021. DOI: 10.3233/JIFS-201581 *
76. Hiroshi Fujiwara, Yuta Wanikawa,and Hiroaki Yamamoto, Asymptotic Approximation Ratios for Certain Classes of Online Bin Packing Algorithms, IEICE Transactions on Information and Systems, Vol. E104–D, No. 3, pp. 362-369, 2021. https://doi.org/10.1587/transinf.2020FCP0004 https://www.jstage.jst.go.jp/article/transinf/E104.D/3/E104.D_2020FCP0004/_pdf/ *
77. Kelin Luo and Frits C.R. Spieksma, Online Bin Packing with Overload Cost, In: Mudgal A., Subramanian C.R. (eds), Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021. Lecture Notes in Computer Science, vol 12601, 2021, pp. 3-15. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-67899-9_1 *
78. Joan Boyar, Lene M. Favrholdt, Shahin Kamali, and Kim S. Larsen Online Bin Covering with Advice, Algorithmica 83, 795–821, 2021. DOI: https://doi.org/10.1007/s00453-020-00728-0 [Citation to the arXiv-version.] *
79. Spyros Angelopoulos, Computation under Uncertainty: From Online Algorithms to Search Games and Interruptible Systems. Habilitation Thesis, Laboratoire d’Informatique de Paris 6, Sorbonne Université, France, 2020. HAL Id: tel-03094902 https://hal.archives-ouvertes.fr/tel-03094902 *
80. Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, and Joseph (Seffi)Naor, Online Virtual Machine Allocation with Predictions, arXiv:2011.06250 [cs.DS], 2020. https://arxiv.org/abs/2011.06250 *
81. Leah Epstein and Asaf Levin, A note on a variant of the online open end bin packing problem, Operations Research Letters, 48(6):844-849, 2020. DOI: https://doi.org/10.1016/j.orl.2020.10.006
82. Susanne Albers, Arindam Khan, and Leon Ladewig, Best Fit Bin Packing with Random Order Revisited, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Javier Esparza and Daniel Kráľ (Eds.), ISBN 978-3-95977-159-7, LIPICS Vol. 170, pp. 7:1–7:15, 2020. DOI: 10.4230/LIPIcs.MFCS.2020.7 *
83. Nikolai Maas, Multilevel Hypergraph Partitioning with Vertex Weights Revisited, Bachelor-Thesis, Karlsruhe Institute of Technology, 22.05.2020. URL: http://algo2.iti.kit.edu/english/4019.php *
84. Paulina Grzegorek, Janusz Januszewski, and Łukasz Zielonka, Efficient 1‑Space Bounded Hypercube Packing Algorithm, Algorithmica, 82, 3216–3249, 2020. DOI: https://doi.org/10.1007/s00453-020-00723-5 [Citation to the arXiv-version.] *
85. Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich and Arne Schmidt, Parallel Online Algorithms for the Bin Packing Problem In: Bampis E., Megow N. (eds) Approximation and Online Algorithms. WAOA 2019. Lecture Notes in Computer Science, vol 11926, pp. 106-119, 2020. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-39479-0_8 Also in: CoRR/arXiv preprint arXiv:abs/1910.03249, 8 Oct 2019. URL: https://arxiv.org/abs/1910.03249 *
86. Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, and Marc Renault, Online Computation with Untrusted Advice, Innovations in Theoretical Computer Science Conference (ITCS 2020). Editor: Thomas Vidick; Article No. 52; pp. 52:1–52:15, LIPIcs 151, 2020. DOI: 10.4230/LIPIcs.ITCS.2020.52 ( Also in: arXiv:1905.05655 [cs.DS], 14 May 2019. https://arxiv.org/abs/1905.05655 ) [Citation to the arXiv-version.] *
87. Jansen, K. and Klein, K.-M., A robust AFPTAS for online bin packing with polynomial migration, SIAM Journal on Discrete Mathematics, 33(4):2062-2091, 2019. DOI: 10.1137/17M1122529 [Citation to the arXiv-version.] *
88. Leah Epstein, On bin packing with clustering and bin packing with delays, CoRR/arXiv preprint arXiv:abs/1908.06727, 2019. 19 Aug 2019. URL: https://arxiv.org/abs/1908.06727
89. Leah Epstein, A lower bound for online rectangle packing, Journal of Combinatorial Optimization, 38(3): 846–866, 2019. DOI: https://doi.org/10.1007/s10878-019-00423-z URL: https://link.springer.com/article/10.1007/s10878-019-00423-z Also in: arXiv:1811.09573, 23 Nov 2018. https://arxiv.org/abs/1811.09573
90. Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen: Online Bin Covering with Advice, In: Friggstad Z., Sack JR., Salavatipour M. (eds.), Algorithms and Data Structures, WADS 2019. Lecture Notes in Computer Science (LNCS), vol. 11646, pp. 225-238. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-24766-9_17 Also in: arXiv:1905.00066 [cs.DS], 30 Apr 2019. https://arxiv.org/abs/1905.00066 [A citation of the arXiv-version of our paper.] *

    [BBDEL19] Balogh, J., J. Békési, Gy. Dósa, L. Epstein, and A. Levin, Lower bounds for several online variants of bin packing, Theory of Computing Systems, 63(8), 1757-1780, 2019. DOI: https://doi.org/10.1007/s00224-019-09915-1

91. Kilian Grage, 2024. On Algorithms for Multidimensional Packing Problems and on the Complexity of higher dimensional Knapsack. Dissertation, Doktor der Ingenieurwissenschaften (Dr.-Ing.), 2024. Thesis advisor: Prof. Dr. Jansen, Klaus. Christian-Albrechts-Universität zu Kiel, Germany. URN: urn:nbn:de:gbv:8:3-2024-01185-9 URL: https://macau.uni-kiel.de/receive/macau_mods_00005487?lang=en *
92. Pouria Zamani Nezhad, Online Square Packing with Prediction, MSc Thesis, University of Manitoba, Winnipeg, Manitoba, 2023. URI: http://hdl.handle.net/1993/37888 *
93. Leah Epstein and Loay Mualem,  Online Bin Packing of Squares and Cubes, Algorithmica, 85, 1415–1458, 2023. DOI: https://doi.org/10.1007/s00453-022-01078-9 URL: https://link.springer.com/article/10.1007/s00453-022-01078-9
94. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, Theoretical Computer Science, 942, 213-229, 2023. DOI: https://doi.org/10.1016/j.tcs.2022.11.034
95. Pooya Nikbakht, Applications and Extensions of The Bin Packing Problem, MSc-Thesis, University of Manitoba, Winnipeg, Manitoba, Canada. 2021. URI: http://hdl.handle.net/1993/36164 *
96. Leah Epstein and Loay Mualem, Online Bin Packing of Squares and Cubes, In: Lubiw A., Salavatipour M. (Eds.), Algorithms and Data Structures, WADS 2021. Lecture Notes in Computer Science, vol. 12808, 2021. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-83508-8_26
97. Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, and Yoshiko Wakabayashi, A tight lower bound for the online bounded space hypercube bin packing problem, DMTCS:8325 - Discrete Mathematics & Theoretical Computer Science, vol. 23:3, 2021, #7 https://doi.org/10.46298/dmtcs.8325 Source: arXiv:2107.14161v2 [math.CO], 7 Sep 2021. https://arxiv.org/pdf/2107.14161v2.pdf *
98. Loay Mualem, Online bin packing of squares and cubes, MSc Thesis, University of Haifa, Supervised by: Prof. Leah Epstein, 2021. https://www.proquest.com/openview/48b5507ffca5bcfe641d9865270945d8/ *
99. Leah Epstein, A lower bound for online rectangle packing, Journal of Combinatorial Optimization, 38(3): 846–866, 2019. DOI: https://doi.org/10.1007/s10878-019-00423-z URL: https://link.springer.com/article/10.1007/s10878-019-00423-z Also in: arXiv:1811.09573, 23 Nov 2018. https://arxiv.org/abs/1811.09573

    [BEL19] Balogh, J., L. Epstein, and A. Levin, Lower bounds for online bin covering-type problems, Journal of Scheduling, 22(4), 487–497, 2019. Springer US. DOI: https://doi.org/10.1007/s10951-018-0590-0

100. Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic, Online Bin Covering with Exact Parameter Advice, Informatica, 48(4):513–520, 2024. DOI: https://doi.org/10.31449/inf.v48i4.4801 * Also in: arXiv:2309.13647 [cs.DS], 24 Sep 2023. https://doi.org/10.48550/arXiv.2309.13647 *
101. Asaf Levin, The near exact bin covering problem, Algorithmica, 86, 2041–2066, 2024. DOI: https://doi.org/10.1007/s00453-024-01224-5 Also in: arXiv:2202.10904 [cs.DS], 22 Feb 2022. https://doi.org/10.48550/arXiv.2202.10904
102. Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, and Lars Rohwedder, Online Bin Covering with Limited Migration, Journal of Computer and System Sciences, 134, 42-72, 2023. DOI: https://doi.org/10.1016/j.jcss.2023.01.001
103. Andrej Brodnik, Bengt J. Nilsson, and Gordana Vujovic, Online Bin Covering with Exact Advice, In: Andrej Brodnik, Gábor Galambos, Branko Kavsek (Eds.), Proceedings of the 25th International Multiconference INFORMATION SOCIETY Volume I: Middle-European Conference on Applied Theoretical Computer Science, Ljubljana, Slovenia: Institut Jožef Stefan, pp. 13-16, 2022. URL: https://is.ijs.si/wp-content/uploads/2022/is2022zborniki/IS2022_Volume-I.pdf ISSN 2630-371X ISBN 978-961-264-248-8 (PDF) *
104. Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, and Lars Rohwedder, Online Bin Covering with Limited Migration, 27th Annual European Symposium on Algorithms (ESA 2019), Editors: Michael A. Bender, Ola Svensson, and Grzegorz Herman, Article No. 18; pp. 18:1–18:14. Leibniz International Proceedings in Informatics, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany. DOI: 10.4230/LIPIcs.ESA.2019.18 Also: arXiv/CoRR, abs/1904.06543, [cs.DS], 13 Apr 2019. https://arxiv.org/abs/1904.06543

     [BB19] A. Bódis and J. Balogh, Bin packing problem with scenarios, Central European Journal of Operations Research, 27(2), 377–395, 2019. DOI: https://doi.org/10.1007/s10100-018-0574-3

105. Yulle G.F. Borges, Vinícius L. de Lima, Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Thiago A. de Queiroz, and Rafael C. S. Schouery, Algorithms for the bin packing problem with scenarios, Journal of Combinatorial Optimization, Volume 48, article number 34, 2024. DOI: https://doi.org/10.1007/s10878-024-01221-y * Also in: arXiv:2305.15351 [math.OC], https://doi.org/10.48550/arXiv.2305.15351 24 May 2023. *
106. Mahmud Parvez, Pratik J. Parikh, Faisal Aqlan, and Md. Noor-e-Alam, An online dynamic dual bin packing with lookahead approach for server-to-cell assignment in computer server industry, Computers & Industrial Engineering, Volume 196, 110404, 2024. DOI: https://doi.org/10.1016/j.cie.2024.110404 *
107. Leah Epstein, Tighter bounds for the harmonic bin packing algorithm, European Journal of Operational Research, 316(1):72-84, 2024. DOI: https://doi.org/10.1016/j.ejor.2024.01.051 *
108. Khadija Hadj Salem, Elsa Silva, and José Fernando Oliveira, Cutting and packing problems under uncertainty: literature review and classification framework, International Transactions is Operational Research, 30:3329–3360, 2023. DOI: https://doi.org/10.1111/itor.13318 URL: https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13318 *
109. Luis Ribeiroand Anan Ashrabi Ananno, A Software Toolbox for Realistic Dataset Generation for Testing Online and Offline 3D Bin Packing Algorithms, Processes, 11(7):1909, 2023. DOI: https://doi.org/10.3390/pr11071909 *
110. Elles Joanne de Rooij, Leveling inbound flow : item allocation under fixed capacity inbound flow at the Ahold Delhaize Inbound Logistics department. MSc-Thesis (60029), University of Twente, NL, 2023. URL: https://purl.utwente.nl/essays/94957 *
111. Qu, Xingyu and Hu, Chaolang, An empirically efficient two-phase heuristic algorithm for two-dimensional bin packing problem Proceedings of SPIE - The International Society for Optical Engineering, Volume 12301, 2022. Article number 123012E 6th International Conference on Mechatronics and Intelligent Robotics, ICMIR 2022, Kunming, 20 May 2022 -- 22 May 2022. ISSN: 0277786X ISBN: 978-151065663-5 DOI: 10.1117/12.2644671 https://www.scopus.com/record/display.uri?origin=citedby&eid=2-s2.0-85142803104 *
112. Yulle Borges, Thiago de Queiroz, Vinícius Lima, Flavio Miyazawa, Lehilton Pedrosa, Um esquema de aproximação para um problema de empacotamento com cenários, In: Encontro de Teoria da Computação, 4., 2019, Belém. 2019: Anais do IV Encontro de Teoria da Computação. Porto Alegre: Sociedade Brasileira de Computação, July 2019. ISSN 2595-6116. DOI: https://doi.org/10.5753/etc.2019.6400. (in Portuguese) *

     [BBDSS19] J. Balogh, J. Békési, G. Dósa, J. Sgall, and R. van Stee, The optimal absolute ratio for online bin packing, Journal of Computer and System Sciences, 102, 1–17, 2019. DOI: https://doi.org/10.1016/j.jcss.2018.11.005

113. O. Braun, F. Chung, and R.L. Graham, Lower bounds for online scheduling on four processors, Journal of Scheduling, 2025+, in press. DOI: https://doi.org/10.1007/s10951-025-00843-2 *
114. Mohsen Abdolhosseinzadeh, Mehdi Djahangiri, and Mir Mohammad Alipour, Local and global information in online stochastic shortest path problem and competitive analysis, Journal of Information and Optimization Sciences, Pages 1-17, 2025+, in press. DOI: https://doi.org/10.47974/JIOS-1584 *
115. Yulle G.F. Borges, Vinícius L. de Lima, Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Thiago A. de Queiroz, and Rafael C. S. Schouery, Algorithms for the bin packing problem with scenarios, Journal of Combinatorial Optimization, Volume 48, article number 34, 2024. DOI: https://doi.org/10.1007/s10878-024-01221-y * Also in: arXiv:2305.15351 [math.OC], https://doi.org/10.48550/arXiv.2305.15351 24 May 2023. *
116. Martin Böhm, Matej Lieskovský, Sören Schmitt, Jiří Sgall, and Rob van Stee, Improved Online Load Balancing with Known Makespan, In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), 317, pp. 10:1-10:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024. DOI: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.10 Also in: arXiv: 2407.08376 [cs.DS], 11 Jul 2024. URL: https://arxiv.org/abs/2407.08376
117. Jiayin Zhang, Huiqun Yu, Guisheng Fan, Qifeng Tang, Zengpeng Li, and Jin Xu, Cold-Start Aware Cloud-Native Parallel Service Function Chain Caching in Edge-Cloud Network, IEEE Internet of Things Journal, 11(11): 20340 - 20356, 2024. IEEE. DOI: 10.1109/JIOT.2024.3369620 *
118. Célia Escribe, Michael Hu, and Retsef Levi, Competitive Algorithms for the Online Minimum Peak Job Scheduling, Operations Research, Volume 73, Issue 1, Pages 408–423. DOI: https://doi.org/10.1287/opre.2021.0080 * Also in: Competitive Algorithms for the Online Minimum Peak Appointment Scheduling (February 17, 2021). Available at SSRN: https://ssrn.com/abstract=3787306 or http://dx.doi.org/10.2139/ssrn.3787306 *
119. Békési József, Hozzájárulás kombinatorikus optimalizálási problémák egy osztályához = Contribution to a Class of Combinatorial Optimization Problems. Hozzájárulás kombinatorikus optimalizálási problémák egy osztályához, Doktori értekezes tézisei, Akadémiai nagydoktori thesis, Szegedi Tudományegyetem, 2023. URL: http://real-d.mtak.hu/id/eprint/1496
120. Salma Mezghani, Boukthir Haddar, and Habib Chabchoub, The evolution of rectangular bin packing problem — A review of research topics, applications, and cited papers, Journal of Industrial and Management Optimization, 19(5):3329-3361, 2023. DOI: 10.3934/jimo.2022088 URL: https://www.aimsciences.org/article/doi/10.3934/jimo.2022088 *
121. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, Theoretical Computer Science, 942, 213-229, 2023. DOI: https://doi.org/10.1016/j.tcs.2022.11.034 *
122. Devin Smedira and David Shmoys, Scheduling Appointments Online: The Power of Deferred Decision-Making. International Workshop on Approximation and Online Algorithms, WAOA 2022, Lecture Notes in Computer Science (LNCS,volume 13538), pp. 82–115, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-031-18367-6_5 * Also in: arXiv:2111.13986 [cs.DS], https://arxiv.org/abs/2111.13986 27 Nov 2021. [ Citation of the arXiv-version of our paper. ] *
123. Célia Escribe, Reducing Physician Burnout and Costs in Outpatient Healthcare Settings via Advanced Analytics MSc Thesis, Massachusetts Institute of Technology, Operations Research Center. 2021. URI: https://hdl.handle.net/1721.1/139300 *
124. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, In: Koenemann J., Peis B. (Eds,), Approximation and Online Algorithms. WAOA 2021. Lecture Notes in Computer Science, Vol. 12982, 117-129, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-92702-8_8 * Also in: arXiv:2107.08725 [cs.DS], 19 Jul 2021. https://arxiv.org/abs/2107.08725 *
125. Leah Epstein, On bin packing with clustering and bin packing with delays, Discrete Optimization, Vol. 41, 2021, Paper 100647. https://doi.org/10.1016/j.disopt.2021.100647 Also in: CoRR/arXiv preprint arXiv:abs/1908.06727, 2019. URL: https://arxiv.org/abs/1908.06727 *
126. Kelin Luo and Frits C.R. Spieksma, Online Bin Packing with Overload Cost, In: Mudgal A., Subramanian C.R. (eds), Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021. Lecture Notes in Computer Science, vol 12601, 2021, pp. 3-15. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-67899-9_1

     [BBDEL18] Balogh, J., J. Békési, Gy. Dósa, L. Epstein, and A. Levin, A new and improved algorithm for online bin packing, In: Azar, Y., Bast, H., Herman, G. (eds.), 26th Annual European Symposium on Algorithms (ESA 2018), LIPIcs, Vol. 112., pp. 5:1–5:14, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018. (Also in: arXiv preprint CoRR arXiv:1707.01728 , 2017.)

127. Matthias Gehnen and Andreas Usdenski, Online Bin Packing with Item Size Estimates, arXiv:2505.09321v1 [cs.DS], 14 May 2025. DOI: https://doi.org/10.48550/arXiv.2505.09321 *
128. Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, and K. V. N. Sreenivas, Near-optimal Algorithms for Stochastic Online Bin Packing, ACM Transactions on Algorithms, Volume 21, Issue 2, Article No.: 24, pp. 1-39, 2025. DOI: https://doi.org/10.1145/3728642 *
129. Mahtab Masoori, Lata Narayanan, and Denis Pankratov, Renting servers in the cloud: The case of equal duration jobs, Discrete Applied Mathematics 362, 82–99. 2025. DOI: https://doi.org/10.1016/j.dam.2024.11.015 [ Citation of the arXiv-version of our paper. ] *
130. Yaqiao Li, Mahtab Masoori, Lata Narayanan, and Denis Pankratov, Renting Servers for Multi-Parameter Jobs in the Cloud, ICDCN '25: Proceedings of the 26th International Conference on Distributed Computing and Networking, pp. 36-45, 2025. DOI: https://doi.org/10.1145/3700838.3700850 Also in: arXiv:2404.15444 [cs.DS], 23 Apr 2024. https://doi.org/10.48550/arXiv.2404.15444 [ Citation of the arXiv-version of our paper. ] *
131. Konstantina Mellou, Marco Molinaro, and Rudy Zhou, The Power of Migrations in Dynamic Bin Packing, Proceedings of the ACM on Measurement and Analysis of Computing Systems, Volume 8, Issue 3, Article No.: 45, Pages 1-28, 2024. DOI: https://doi.org/10.1145/3700435 *
132. Konstantina Mellou, Marco Molinaro, and Rudy Zhou, The Power of Migrations in Dynamic Bin Packing, arXiv:2408.13178 [cs.DS], 23 Aug 2024. DOI: https://doi.org/10.48550/arXiv.2408.13178 *
133. Julien Dallot, Maciej Pacut, Marcin Bienkowski, Darya Melnyk, and Stefan Schmid, Learning Minimum Linear Arrangement of Cliques and Lines, 2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS), Jersey City, NJ, USA, 2024, pp. 175-185. DOI: 10.1109/ICDCS60910.2024.00025. URL: https://ieeexplore.ieee.org/document/10631019 * Also in: arXiv:2405.15963 [cs.DS], 24 May 2024. DOI: https://doi.org/10.48550/arXiv.2405.15963 *
134. Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, and Marc Renault, Online Computation with Untrusted Advice, Journal of Computer and System Sciences, Volume 144, Paper No. 103545, 24 pp., 2024. DOI: https://doi.org/10.1016/j.jcss.2024.103545 *
135. Leah Epstein, Tighter bounds for the harmonic bin packing algorithm, European Journal of Operational Research, 316(1):72-84, 2024. DOI: https://doi.org/10.1016/j.ejor.2024.01.051
136. Bingchen Lin, Jiawei Li, Tianxiang Cui, Huan Jin, Ruibin Bai, Rong Qu, and Jon Garibaldi, A pattern-based algorithm with fuzzy logic bin selector for online bin packing problem, Expert Systems with Applications, Volume 249, Part A, 123515, 2024. DOI: https://doi.org/10.1016/j.eswa.2024.123515 *
137. Mahtab Masoori, Lata Narayanan, and Denis Pankratov, Renting Servers in the Cloud: Parameterized Analysis of FirstFit ICDCN '24: Proceedings of the 25th International Conference on Distributed Computing and Networking, 199–208, 2024. DOI: https://doi.org/10.1145/3631461.3631557 [ Citation of the arXiv-version of our paper. ] *
138. Romera-Paredes, B., Barekatain, M., Novikov, A. et al., Mathematical discoveries from program search with large language models. Nature, 625, 468–475, 2024. DOI: https://doi.org/10.1038/s41586-023-06924-6 *
139. Anish Hebbar, Arindam Khan, and K. V. N. Sreenivas, Bin Packing under Random-Order: Breaking the Barrier of 3/2, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 4177-4219, 2024. DOI: 10.1137/1.9781611977912.145, URL: https://epubs.siam.org/doi/abs/10.1137/1.9781611977912.145, eprint: {https://epubs.siam.org/doi/pdf/10.1137/1.9781611977912.145 *
140. Sara Ali, António Galrão Ramos, Maria Antónia Carravilla, and José Fernando Oliveira, Heuristics for online three-dimensional packing problems and algorithm selection framework for semi-online with full look-ahead, Applied Soft Computing, 151, 111168, 2024. DOI: https://doi.org/10.1016/j.asoc.2023.111168 [ Citation of the arXiv-version of our paper. ] *
141. Walter R. Benitez Davalos, Reinforcement Learning for Multi-Objective Online Virtual Machine Placement: An experimental evaluation, MSc Thesis, The University of Melbourne, 2023. [ Citation of the arXiv-version of our paper. ] *
142. Spyros Angelopoulos, Shahin Kamali, and Kimia Shadkami, Online Bin Packing with Predictions, Journal of Artificial Intelligence Research, 78, 1111-1141, 2023. DOI: 10.1613/jair.1.14820 *
143. Pouria Zamani Nezhad, Online Square Packing with Prediction, MSc Thesis, University of Manitoba, Winnipeg, Manitoba, 2023. URI: http://hdl.handle.net/1993/37888 *
144. Spyros Angelopoulos, Shahin Kamali, and Kimia Shadkami, Online Bin Packing with Predictions, Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22), pp. 4574-4580, 2022. https://doi.org/10.24963/ijcai.2022/635 * Also in: arXiv:2102.03311v1 [cs.DS], 5 Feb 2021, https://arxiv.org/pdf/2102.03311.pdf *
145. Konstantina Mellou, Marco Molinaro, and Rudy Zhou, Online Demand Scheduling with Failovers, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Editors: Kousha Etessami, Uriel Feige, and Gabriele Puppis; Article No. 92; pp. 92:1–92:20. LIPICS, DROPS, Germany. DOI: 10.4230/LIPIcs.ICALP.2023.92 URL: https://drops.dagstuhl.de/opus/volltexte/2023/18144/ * Also in: arXiv:2209.00710 [cs.DS], 1 Sep 2022. DOI: https://doi.org/10.48550/arXiv.2209.00710 URL: https://arxiv.org/abs/2209.00710 *
146. Célia Escribe, Michael Hu, and Retsef Levi, Competitive Algorithms for the Online Minimum Peak Job Scheduling, Operations Research, Volume 73, Issue 1, Pages 408–423. DOI: https://doi.org/10.1287/opre.2021.0080 [Ref. to the arXiv-version.] * Also in: Competitive Algorithms for the Online Minimum Peak Appointment Scheduling (February 17, 2021). Available at SSRN: https://ssrn.com/abstract=3787306 or http://dx.doi.org/10.2139/ssrn.3787306 *
147. Claus-Jochen Haake, Burkhard Hehenkamp, and Gleb Polevoy, The Market for Services: Incentives, Algorithms, Implementation. In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim (Eds.), 412:21–44. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, ISBN 978-3-947647-31-6, 2023. DOI: https://doi.org/10.5281/zenodo.8068414 *
148. Adam Lechowicz, Rik Sengupta, Bo Sun, Shahin Kamali, and Mohammad Hajiesmaili, Time Fairness in Online Knapsack Problems, arXiv:2305.13293 [cs.LG], https://doi.org/10.48550/arXiv.2305.13293 22 May 2023. *
149. Zhadyra Khattar, Online Timely Bin Packing, Master Thesis for Computing Science, August 2023, 1st supervisor: Dr. H. H. (Alison) Liu, 2nd supervisor: Dr. H. Bodlaender, Utrecht University, NL. URL: https://studenttheses.uu.nl/handle/20.500.12932/45024 *
150. Békési József, Hozzájárulás kombinatorikus optimalizálási problémák egy osztályához = Contribution to a Class of Combinatorial Optimization Problems. Hozzájárulás kombinatorikus optimalizálási problémák egy osztályához, Doktori értekezes tézisei, Akadémiai nagydoktori thesis, Szegedi Tudományegyetem, 2023. URL: http://real-d.mtak.hu/id/eprint/1496
151. Leah Epstein and Loay Mualem,  Online Bin Packing of Squares and Cubes, Algorithmica, 85:1415–1458, 2023 DOI: https://doi.org/10.1007/s00453-022-01078-9 URL: https://link.springer.com/article/10.1007/s00453-022-01078-9
152. Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, and Arne Schmidt, Parallel Online Algorithms for the Bin Packing Problem, Algorithmica, 85, 296–323, 2023. https://doi.org/10.1007/s00453-022-01030-x *
153. Ankush Ojha, Marichi Agarwal, Aniruddha Singhal, Chayan Sarkar, Supratim Ghosh, and Rajesh Sinha, A generalized algorithm and framework for online 3-dimensional bin packing in an automated sorting center, In: 2021 Seventh Indian Control Conference (ICC), 20-22 December 2021, Mumbai, India, pp. 135-140. DOI: 10.1109/ICC54714.2021.9703142 URL: https://ieeexplore.ieee.org/document/9703142 * Also in: arXiv: preprint 2111.01072 [cs.RO], 1 Nov 2021, https://arxiv.org/abs/2111.01072 *
154. Sizhe Li, Jinghui Xue, Mingming Jin, Kai Wang, and Kun He,  A 4-Space Bounded Approximation Algorithm for Online Bin Packing Problem, In: Zhang, Y., Miao, D., Möhring, R. (eds.), Computing and Combinatorics, COCOON 2022. Lecture Notes in Computer Science, vol. 13595, pp. 394–405, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-031-22105-7_35 *
155. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, Theoretical Computer Science, 942, 213-229, 2023. DOI: https://doi.org/10.1016/j.tcs.2022.11.034
156. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, In: Koenemann J., Peis B. (Eds,), Approximation and Online Algorithms. WAOA 2021. Lecture Notes in Computer Science, Vol. 12982, 117-129, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-92702-8_8 Also in: arXiv:2107.08725 [cs.DS], 19 Jul 2021. https://arxiv.org/abs/2107.08725
157. Marin Bougeret, György Dósa, Noam Goldberg, and Michael Poss, Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty SIAM Journal on Discrete Mathematics, 36(4):2534-2552, 2022. DOI: 10.1137/21M1457199 URL: https://doi.org/10.1137/21M1457199 Also in: hal-02119351v3, 2020. HAL Id: hal-02119351, https://hal.archives-ouvertes.fr/hal-02119351v3 Preprint submitted on 30 Oct 2020.
158. Devin Smedira and David Shmoys, Scheduling Appointments Online: The Power of Deferred Decision-Making. International Workshop on Approximation and Online Algorithms, WAOA 2022, Lecture Notes in Computer Science (LNCS,volume 13538), pp. 82–115, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-031-18367-6_5 [ Citation of the arXiv-version of our paper. ] * Also in: arXiv:2111.13986 [cs.DS], https://arxiv.org/abs/2111.13986 27 Nov 2021. [ Citation of the arXiv-version of our paper. ] *
159. Sebastian Walter Perez Salazar, New benchmarking techniques in resource allocation problems: theory and applications in cloud systems, PhD Thesis, Georgia Institute of Technology, 2022. URI: http://hdl.handle.net/1853/67199 *
160. Leah Epstein, Open-end bin packing: New and old analysis approaches, Discrete Applied Mathematics, 321(15):220-239, 2022. DOI: https://doi.org/10.1016/j.dam.2022.07.003
161. Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, and K.V.N. Sreenivas, Near-Optimal Algorithms for Stochastic Online Bin Packing, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Editors: Mikołaj Bojańczyk, Emanuela Merelli, and David P. Woodruff; Article No. 12; pp. 12:1–12:20, LIPIcs, Dagstuhl Publishing, Germany. DOI: 10.4230/LIPIcs.ICALP.2022.12 URL: https://drops.dagstuhl.de/opus/volltexte/2022/16353/ Also in: arXiv:2205.03622v1 [cs.DS], 7 May 2022, URL: https://arxiv.org/pdf/2205.03622.pdf *
162. Hua Chen and Guochuan Zhang, A survey on approximation algorithms for one dimensional bin packing, Operations Research Transactions, 26(1): 69-84, 2022. (In Chinese.) DOI: 10.15960/j.cnki.issn.1007-6093.2022.01.005 *
163. Shahin Kamali and Pooya Nikbakht, Online Square Packing With Rotation, Proceedings of the 34th Canadian Conference on Computational Geometry, CCCG 2022, pp. 189-197, 2022. (Toronto, 25 August 2022 through 27 August 2022.) https://www.scopus.com/inward/record.uri?eid=2-s2.0-85173819585&partnerID=40&md5=b60d0948fe8b6dccbc0f4c1b22d1de3 * Also in: URL: https://iccg2022.ce.sharif.edu/files/Papers/6-Online-Square-Packing-With-Rotation.pdf *
164. Sara Ali, António Galrão Ramos, Maria Antónia Carravilla, and José Fernando Oliveira, On-line three-dimensional packing problems: a review of off-line and on-line solution approaches, Computers & Industrial Engineering, Volume 168, June 2022, 108122. DOI: https://doi.org/10.1016/j.cie.2022.108122 * [Ref. to the arXiv-version of our paper.]
165. Sebastian Perez-Salazar, Mohit Singh, and Alejandro Toriello, Adaptive Bin Packing with Overflow, Mathematics of Operations Research, 47(4):3317-3356, 2022. DOI: https://doi.org/10.1287/moor.2021.1239 * Also in: Online Adaptive Bin Packing with Overflow, arXiv:2007.11532 [math.OC], 22 Jul 2020. https://arxiv.org/abs/2007.11532 *
166. Eklavya Sharma, Harmonic algorithms for packing d-dimensional cuboids into bins, Leibniz International Proceedings in Informatics (LIPIcs) Volume 2131, 2021. Article number 32. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021 Virtual, Online 15 December 2021 through 17 December 2021, Code 175957. DOI: DOI 10.4230/LIPIcs.FSTTCS.2021.32 * Also in: arXiv:2011.10963 [cs.CG], 22 Nov 2020. https://arxiv.org/abs/2011.10963 *
167. Loay Mualem, Online bin packing of squares and cubes, MSc Thesis, University of Haifa, Supervised by: Prof. Leah Epstein, 2021. https://www.proquest.com/openview/48b5507ffca5bcfe641d9865270945d8/ *
168. Célia Escribe, Reducing Physician Burnout and Costs in Outpatient Healthcare Settings via Advanced Analytics MSc Thesis, Massachusetts Institute of Technology, Operations Research Center. 2021. URI: https://hdl.handle.net/1721.1/139300 * [Ref. to the arXiv paper.]
169. Pooya Nikbakht, Applications and Extensions of The Bin Packing Problem, MSc-Thesis, University of Manitoba, Winnipeg, Manitoba, Canada. 2021. URI: http://hdl.handle.net/1993/36164 *
170. Eklavya Sharma, Approximation Algorithms for Geometric Packing Problems Thesis, Master of Technology (Research), Computer Science and Automation, Indian Institute of Science, Bangalore, India, 2021. *
171. Leah Epstein and Loay Mualem, Online Bin Packing of Squares and Cubes, In: Lubiw A., Salavatipour M. (Eds.), Algorithms and Data Structures, WADS 2021. Lecture Notes in Computer Science, vol. 12808, 2021. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-83508-8_26
172. Agostino Mascitti, Tommaso Cucinotta, and Luca Abeni, Combining admission tests for heuristic partitioning of real-time tasks on ARM big.LITTLE multi-processor architecture, Journal of Systems Architecture 119, paper 102229, 2021. DOI: https://doi.org/10.1016/j.sysarc.2021.102229 [Ref. to the arXiv-version.] *
173. Susanne Albers, Arindam Khan, and Leon Ladewig, Best Fit Bin Packing with Random Order Revisited, Algorithmica, 83, 2833–2858, 2021. DOI: https://doi.org/10.1007/s00453-021-00844-5 *
174. Hiroshi Fujiwara, Ken Endo, and Hiroaki Yamamoto, Analysis of Lower Bounds for Online Bin Packing with Two Item Sizes, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2021+. Article ID: 2020DMP0007. DOI: https://doi.org/10.1587/transfun.2020DMP0007 *
175. Leah Epstein, On bin packing with clustering and bin packing with delays, Discrete Optimization, Vol. 41, 2021, Paper 100647. https://doi.org/10.1016/j.disopt.2021.100647 Also in: CoRR/arXiv preprint arXiv:abs/1908.06727, 2019. URL: https://arxiv.org/abs/1908.06727
176. Bakhthemmat, A. and Izadi, M., Solving fully dynamic bin packing problem for virtual machine allocation in the cloud environment by the futuristic greedy algorithm, Journal of Intelligent and Fuzzy Systems, 40(3):4737-4760, 2021. DOI: 10.3233/JIFS-201581 [Citation of the arXiv-version of our paper.] *
177. Joan Boyar, Lene M. Favrholdt, Shahin Kamali, and Kim S. Larsen Online Bin Covering with Advice, Algorithmica 83, 795–821, 2021. DOI: https://doi.org/10.1007/s00453-020-00728-0 *
178. Kelin Luo and Frits C.R. Spieksma, Online Bin Packing with Overload Cost, In: Mudgal A., Subramanian C.R. (eds), Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021. Lecture Notes in Computer Science, vol 12601, 2021, pp. 3-15. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-67899-9_1
179. Spyros Angelopoulos, Computation under Uncertainty: From Online Algorithms to Search Games and Interruptible Systems. Habilitation Thesis, Laboratoire d’Informatique de Paris 6, Sorbonne Université, France, 2020. HAL Id: tel-03094902 https://hal.archives-ouvertes.fr/tel-03094902 *
180. Debarsho Sannyasi, Improved Approximation Algorithms for Weighted Edge Coloring of Graphs, arXiv:2012.15056 [cs.DS], 2020. https://arxiv.org/abs/2012.15056 *
181. L. R. Darwish, M. M. Farag, and M. T. El-Wakad, Towards Reinforcing Healthcare 4.0: A Green Real-Time IIoT Scheduling and Nesting Architecture for COVID-19 Large-Scale 3D Printing Tasks, in IEEE Access, vol. 8, pp. 213916-213927, 2020. DOI: 10.1109/ACCESS.2020.3040544. URL: https://ieeexplore.ieee.org/abstract/document/9269973 *
182. Graham Cormode and Pavel Veselý, Streaming Algorithms for Bin Packing and Vector Scheduling, Theory of Computing Systems, 65:916–942, 2021. DOI: https://doi.org/10.1007/s00224-020-10011-y URL: https://link.springer.com/article/10.1007/s00224-020-10011-y *
183. Eklavya Sharma, Analysis of the Harmonic Function Used in Bin-Packing, arXiv:2011.11618 [cs.DS], 23 Nov 2020. https://arxiv.org/abs/2011.11618 *
184. Leah Epstein and Asaf Levin, A note on a variant of the online open end bin packing problem, Operations Research Letters, 48(6):844-849, 2020. DOI: https://doi.org/10.1016/j.orl.2020.10.006
185. Varun Gupta and Ana Radovanović, Interior-Point-Based Online Stochastic Bin Packing, Operations Research, 68(5):1474–1492, 2020, INFORMS. https://doi.org/10.1287/opre.2019.1914 [Also available at SSRN: https://ssrn.com/abstract=2673951 or http://dx.doi.org/10.2139/ssrn.2673951 68 pages. Posted: 14 Oct 2015. Last revised: 21 Nov 2019] *
186. Susanne Albers, Arindam Khan, and Leon Ladewig, Best Fit Bin Packing with Random Order Revisited, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Javier Esparza and Daniel Kráľ (Eds.), ISBN 978-3-95977-159-7, LIPICS Vol. 170, pp. 7:1–7:15, 2020. DOI: 10.4230/LIPIcs.MFCS.2020.7 *
187. Nikhil Bansal and Ilan Reuven Cohen, An Asymptotic Lower Bound for Online Vector Bin Packing, arXiv:2007.15709v2 [cs.DS], 4 Aug 2020. https://arxiv.org/abs/2007.15709 [Citation of the arXiv-version.] *
188. Richa Verma, Aniruddha Singhal, Harshad Khadilkar, Ansuma Basumatary, Siddharth Nayak, Harsh Vardhan Singh, Swagat Kumar, and Rajesh Sinha, A Generalized Reinforcement Learning Algorithm for Online 3D Bin-Packing, arXiv:2007.00463v1 [cs.AI], 1 Jul 2020, 9 pages. https://arxiv.org/abs/2007.00463 [Citation of arXiv preprint arXiv:1707.01728.] *
189. Paulina Grzegorek, Janusz Januszewski, and Łukasz Zielonka, Efficient 1‑Space Bounded Hypercube Packing Algorithm, Algorithmica, 82, 3216–3249, 2020. DOI: https://doi.org/10.1007/s00453-020-00723-5 [Citation of the arXiv-version of our paper.] *
190. A. Mascitti, T. Cucinotta, and L. Abeni, Heuristic partitioning of real-time tasks on multi-processors, in Proceedings of the 2020 IEEE 23rd International Symposium on Real-Time Distributed Computing (ISORC), Nashville, Tennessee, USA, 2020 May 19-21, pp. 36-42. DOI: 10.1109/ISORC49007.2020.00015 https://retis.sssup.it/~tommaso/publications/IEEE-ISORC-2020-HEUR.pdf [Ref. to the arXiv-version.] *
191. Vincent Portella and Hong Shen, An Improved Online Multidimensional Bin Packing Algorithm, 2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), Gold Coast, Australia, 2019, pp. 479-482. DOI: 10.1109/PDCAT46702.2019.00094 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9028979&isnumber=9028879 (Citation of the arXiv-version.) *
192. Graham Cormode and Pavel Veselý, Streaming Algorithms for Bin Packing and Vector Scheduling, In: Bampis E., Megow N. (eds) Approximation and Online Algorithms. WAOA 2019. Lecture Notes in Computer Science, vol 11926, pp. 72-88, 2020. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-39479-0_6 Also in: arXiv:1905.04897 [cs.DS], 13 May 2019. https://arxiv.org/abs/1905.04897 *
193. Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich and Arne Schmidt, Parallel Online Algorithms for the Bin Packing Problem In: Bampis E., Megow N. (eds) Approximation and Online Algorithms. WAOA 2019. Lecture Notes in Computer Science, vol. 11926, pp. 106-119, 2020. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-39479-0_8 Also in: CoRR/arXiv preprint arXiv:abs/1910.03249, 8 Oct 2019. URL: https://arxiv.org/abs/1910.03249 *
194. Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, and Marc Renault, Online Computation with Untrusted Advice, Innovations in Theoretical Computer Science Conference (ITCS 2020). Editor: Thomas Vidick; Article No. 52; pp. 52:1–52:15, LIPIcs 151, 2020. DOI: 10.4230/LIPIcs.ITCS.2020.52 Also in: arXiv:1905.05655 [cs.DS], 14 May 2019. https://arxiv.org/abs/1905.05655 *
195. Chuanyou Li and Xueyan Tang, On Fault-Tolerant Bin Packing for Online Resource Allocation, in IEEE Transactions on Parallel and Distributed Systems, vol. 31, no. 4, pp. 817-829, 2019. DOI: 10.1109/TPDS.2019.2948327 URL: https://ieeexplore.ieee.org/document/8877781 *
196. Jansen, K. and Klein, K.-M., A robust AFPTAS for online bin packing with polynomial migration, SIAM Journal on Discrete Mathematics, 33(4):2062-2091, 2019. DOI: 10.1137/17M1122529 *
197. Aniket Basu Roy, Marin Bougeret, Noam Goldberg, and Michael Poss, Approximating Robust Bin Packing with Budgeted Uncertainty, In: Friggstad Z., Sack JR., Salavatipour M. (eds.), Algorithms and Data Structures, WADS 2019. Lecture Notes in Computer Science (LNCS), vol. 11646, pp. 71-84. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-24766-9_6 Also in: HAL archives-ouvertes.fr, HAL Id: hal-02119351 https://hal.archives-ouvertes.fr/hal-02119351/document *
198. Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen: Online Bin Covering with Advice, In: Friggstad Z., Sack JR., Salavatipour M. (eds.), Algorithms and Data Structures, WADS 2019. Lecture Notes in Computer Science (LNCS), vol. 11646, pp. 225-238. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-24766-9_17 Also in: arXiv:1905.00066 [cs.DS], 30 Apr 2019. https://arxiv.org/abs/1905.00066 *
199. Leah Epstein, A lower bound for online rectangle packing, Journal of Combinatorial Optimization, 38(3): 846–866, 2019. DOI: https://doi.org/10.1007/s10878-019-00423-z URL: https://link.springer.com/article/10.1007/s10878-019-00423-z Also in: arXiv:1811.09573, 23 Nov 2018. https://arxiv.org/abs/1811.09573
200. Rob van Stee, SIGACT News Online Algorithms Column 34: 2018 in review, ACM SIGACT News, 49(4):36-45, 2018. ACM New York, NY, USA DOI: 10.1145/3300150.3300160 URL: https://dl.acm.org/citation.cfm?doid=3300150.3300160 *
201. Sebastian Berndt, Klaus Jansen, and Kim-Manuel Klein, Fully dynamic bin packing revisited, Mathematical Programming, 179(1–2):109–155, 2020. DOI: https://doi.org/10.1007/s10107-018-1325-x, Springer Berlin Heidelberg. [Citation of the arXiv version.] *
202. György Dósa and Leah Epstein, The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints, Journal of Computer and System Sciences, 96:33-49, 2018. DOI: https://doi.org/10.1016/j.jcss.2018.03.004
203. David Wajc, Thesis Proposal: Matching Algorithms Under Uncertainty, and Matching Lower Bounds, PhD Thesis Proposal, Carnegie Mellon University, Pittsburgh, 2018. http://halley.exp.sis.pitt.edu/comet/presentColloquium.do?col_id=13465 *
204. Sandy Heydrich, A tale of two packing problems: improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem, Doctoral Thesis, Saarland University, Saarbrücken, 2018. URL: https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/27141 DOI: http://dx.doi.org/10.22028/D291-27240 *
205. Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, and David Wajc, Fully-Dynamic Bin Packing with Little Repacking, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella (Eds.), LIPIcs (Leibniz International Proceedings in Informatics Schloss Dagstuhl), Vol. 107, pp. 51:1–51:24, 2018. Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany. Also: Anupam Gupta, Guru Guruganesh, Amit Kumar, and David Wajc, Fully-Dynamic Bin Packing with Limited Repacking, arXiv:1711.02078 [cs.DS], 6 Nov 2017. https://arxiv.org/abs/1711.02078 *
206. David Blitz, Sandy Heydrich, Rob van Stee, André van Vliet, and Gerhard J. Woeginger, Improved Lower Bounds for Online Hypercube and Rectangle Packing, arXiv:1607.01229v2 [cs.DS], 6 Nov 2017. https://arxiv.org/abs/1607.01229v2 *

     [BBDEL18-17] Balogh, J., J. Békési, Gy. Dósa, L. Epstein, and A. Levin, Lower bounds for several online variants of bin packing, In: Solis-Oba R., Fleischer R. (Eds.), Approximation and Online Algorithms. WAOA 2017. Lecture Notes in Computer Science, Vol. 10787, Springer, Cham, 2018. DOI: https://doi.org/10.1007/978-3-319-89441-6_9 (Preliminary version: CoRR abs/1708.03228, 18 pages, 2017.08.10. https://arxiv.org/abs/1708.03228)

207. Manuel Iori, Vinícius L. de Lima, Silvano Martello, Flávio K. Miyazawa, and Michele Monaci, Exact solution techniques for two-dimensional cutting and packing, European Journal of Operational Research, 289(2):399-415, 2021. DOI: https://doi.org/10.1016/j.ejor.2020.06.050 URL: https://www.sciencedirect.com/science/article/abs/pii/S0377221720306111?via%3Dihub * Also in: arXiv:2004.12619v1 [math.OC], 27 Apr 2020. URL: https://arxiv.org/abs/2004.12619 *
208. Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen and Ingmar Knof, Robust Online Algorithms for Certain Dynamic Packing Problems. In: Bampis E., Megow N. (eds) Approximation and Online Algorithms. WAOA 2019. Lecture Notes in Computer Science, vol 11926, pp. 43-59, 2020. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-39479-0_4 *
209. Leah Epstein, A lower bound for online rectangle packing, arXiv:1811.09573, 23 Nov 2018. https://arxiv.org/abs/1811.09573
210. Sandy Heydrich, A tale of two packing problems: improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem, Doctoral Thesis, Saarland University, Saarbrücken, 2018. URL: https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/27141 DOI: http://dx.doi.org/10.22028/D291-27240 *
211. Rob van Stee, SIGACT News Online Algorithms Column 32: 2017 in review, ACM SIGACT News archive 48(4), 100-109, 2017. ACM New York, NY, USA. DOI: 10.1145/3173127.3173145 *
212. Carsten Fischer and Heiko Röglin, Probabilistic Analysis of (Class-constrained) Bin Packing and Bin Covering, In: Bender M., Farach-Colton M., Mosteiro M. (eds), Latin American Symposium on Theoretical Informatics, LATIN 2018, LNCS 10807. Springer, Cham, 2018, 697-711. DOI: https://doi.org/10.1007/978-3-319-77404-6_34 https://link.springer.com/chapter/10.1007/978-3-319-77404-6_34 Online: www.roeglin.org/publications/LATIN18.pdf *
213. Y. Kohayakawa, F. K. Miyazawa, and Y. Wakabayashi, A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game, In: Bender M., Farach-Colton M., Mosteiro M. (eds), Latin American Symposium on Theoretical Informatics, LATIN 2018, LNCS 10807. Springer, Cham, 2018, 697-711. DOI: https://doi.org/10.1007/978-3-319-77404-6_51 https://link.springer.com/chapter/10.1007/978-3-319-77404-6_51 Manuscript: arXiv:1712.06763 [cs.DS], 19 Dec 2017. https://arxiv.org/abs/1712.06763 [Citing the arXiv-version of our paper.] *
214. David Blitz, Sandy Heydrich, Rob van Stee, André van Vliet, and Gerhard J. Woeginger, Improved Lower Bounds for Online Hypercube and Rectangle Packing, arXiv:1607.01229v2 [cs.DS], 6 Nov 2017. https://arxiv.org/abs/1607.01229v2 *

     [BBDEL17] Balogh, J., J. Békési, Gy. Dósa, L. Epstein, and A. Levin, Online Bin Packing with Cardinality Constraints Resolved, In Proceedings of the 25th European Symposium on Algorithms (ESA 2017), LIPIcs, Vol. 87, pp. 10:1--10:14, 2017. (Preliminary version: CoRR, abs/1608.06415, 2016.)

215. Leah Epstein, A lower bound for online rectangle packing, Journal of Combinatorial Optimization, 38(3): 846–866, 2019. DOI: https://doi.org/10.1007/s10878-019-00423-z URL: https://link.springer.com/article/10.1007/s10878-019-00423-z Also in: arXiv:1811.09573, 23 Nov 2018. https://arxiv.org/abs/1811.09573
216. Leah Epstein and Rob van Stee, Multidimensional Packing Problems, In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Methodologies and Traditional Applications (Teofilo F. Gonzalez, Ed.), Chapter 31, CRC Press, 2018. URL: https://www.routledgehandbooks.com/doi/10.1201/9781351236423-31
217. György Dósa and Leah Epstein, The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints, Journal of Computer and System Sciences, 96:33-49, 2018. DOI: https://doi.org/10.1016/j.jcss.2018.03.004 *
218. Sandy Heydrich, A tale of two packing problems: improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem, Doctoral Thesis, Saarland University, Saarbrücken, 2018. URL: https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/27141 DOI: http://dx.doi.org/10.22028/D291-27240 *
219. Rob van Stee, SIGACT News Online Algorithms Column 32: 2017 in review, ACM SIGACT News archive 48(4), 100-109, 2017. ACM New York, NY, USA. DOI: 10.1145/3173127.3173145 *
220. Carsten Fischer and Heiko Röglin, Probabilistic Analysis of (Class-constrained) Bin Packing and Bin Covering, In: Bender M., Farach-Colton M., Mosteiro M. (eds), Latin American Symposium on Theoretical Informatics, LATIN 2018, LNCS 10807. Springer, Cham, 2018, 697-711. DOI: https://doi.org/10.1007/978-3-319-77404-6_34 https://link.springer.com/chapter/10.1007/978-3-319-77404-6_34 Online: www.roeglin.org/publications/LATIN18.pdf *

     [BBDGT16] Balogh, J., J. Békési, Gy. Dósa, G. Galambos, and Z. Tan, Lower bound for 3-batched bin packing, Discrete Optimization, 21(2016): 14–24.

221. Békési József, Hozzájárulás kombinatorikus optimalizálási problémák egy osztályához = Contribution to a Class of Combinatorial Optimization Problems. Hozzájárulás kombinatorikus optimalizálási problémák egy osztályához, Doktori értekezes tézisei, Akadémiai nagydoktori thesis, Szegedi Tudományegyetem, 2023. URL: http://real-d.mtak.hu/id/eprint/1496
222. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, Theoretical Computer Science, 942, 213-229, 2023. DOI: https://doi.org/10.1016/j.tcs.2022.11.034 *
223. Janusz Januszewski and Łukasz Zielonka, Packing batches of cubes into a single bin, Information Processing Letters, 180, paper 106337, 2023. DOI: https://doi.org/10.1016/j.ipl.2022.106337 *
224. Leah Epstein, Open-end bin packing: New and old analysis approaches, Discrete Applied Mathematics, 321(15):220-239, 2022. DOI: https://doi.org/10.1016/j.dam.2022.07.003 *
225. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, In: Koenemann J., Peis B. (Eds,), Approximation and Online Algorithms. WAOA 2021. Lecture Notes in Computer Science, Vol. 12982, 117-129, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-92702-8_8 * Also in: arXiv:2107.08725 [cs.DS], 19 Jul 2021. https://arxiv.org/abs/2107.08725 *
226. Leah Epstein, On bin packing with clustering and bin packing with delays, Discrete Optimization, Vol. 41, 2021, Paper 100647. https://doi.org/10.1016/j.disopt.2021.100647 Also in: CoRR/arXiv preprint arXiv:abs/1908.06727, 2019. URL: https://arxiv.org/abs/1908.06727 *
227. YANG Ting, LUO Fei, DING Wei-chao, and LU Hai-feng, Bin Packing Algorithm Based on Adaptive Optimization of Slack, Computer Science, 2020, 47(4):211-216, 2020. doi: 10.11896/jsjkx.190500132 URL: http://www.jsjkx.com/EN/10.11896/jsjkx.190500132 *
228. Olyvia Kundu, Samrat Dutta, and Swagat Kumar, Deep-Pack: A Vision-Based 2D Online Bin Packing Algorithm with Deep Reinforcement Learning, Proceedings of 28th IEEE International Conference on Robot and Human Interactive Communication (RO-MAN), New Delhi, India, 2019, pp. 1-7, IEEE. DOI: 10.1109/RO-MAN46459.2019.8956393 URL: https://ieeexplore.ieee.org/document/8956393 *
229. Leah Epstein, A lower bound for online rectangle packing, Journal of Combinatorial Optimization, 38(3): 846–866, 2019. DOI: https://doi.org/10.1007/s10878-019-00423-z URL: https://link.springer.com/article/10.1007/s10878-019-00423-z Also in: arXiv:1811.09573, 23 Nov 2018. https://arxiv.org/abs/1811.09573 *
230. János Csirik and Csanád Imreh, Variants of Classical One Dimensional Bin Packing, In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Methodologies and Traditional Applications (Teofilo F. Gonzalez, Ed.), Chapter 29, CRC Press, 2018. URL: https://www.routledgehandbooks.com/doi/10.1201/9781351236423-29 *
231. Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, and Asaf Levin, Batch Coloring of Graphs, Algorithmica, 80(11):3293–3315, 2018. DOI: 10.1007/s00453-017-0386-1 Also in arXiv:1610.02997 [cs.DS], 10 Oct 2016. https://arxiv.org/abs/1610.02997 *
232. György Dósa, Tight results for some classical bin packing algorithms, University of Pannonia, Veszprém, 2018. http://irt219.irt.vein.hu/habilitacios_anyagok/2018/DosaGyorgy/Habilitacios%20tezisek%20Dosa%20Gyorgy%20angol.pdf Also in Hungarian: Dósa György, Klasszikus ládapakolási algoritmusokra vonatkozó éles eredmények, Habilitációs tézisek, Pannon Egyetem, Veszprém, 2018. http://irt219.irt.vein.hu/habilitacios_anyagok/2018/DosaGyorgy/Habilitacios%20tezisek%20Dosa%20Gyorgy%20magyar.pdf
233. Dósa, György, A First Fit ládapakolási algoritmus néhány változatának éles eredményei (súlyfüggvények alkalmazásával), Akadémiai nagydoktori thesis, Pannon Egyetem, 2016. http://real-d.mtak.hu/978/
234. György Dósa, Batched bin packing revisited, Journal of Scheduling, 20(2):199-209, 2017. DOI: 10.1007/s10951-015-0431-3 URL: https://doi.org/10.1007/s10951-015-0431-3 http://link.springer.com/article/10.1007/s10951-015-0431-3
235. Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, and Asaf Levin, Batch Coloring of Graphs, In: Approximation and Online Algorithms 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers, Lecture Notes in Computer Science, 10138, 52-64. DOI: 10.1007/978-3-319-51741-4_5 URL: https://doi.org/10.1007/978-3-319-51741-4_5 http://link.springer.com/chapter/10.1007/978-3-319-51741-4_5 *
236. Leah Epstein, More on batched bin packing, Operations Research Letters, 44(2016):273–277. DOI: 10.1016/j.orl.2016.02.006 URL: http://dx.doi.org/10.1016/j.orl.2016.02.006 *

     [DB16] Dávid, B. and J. Balogh, An Algorithmic Framework for Real-Time Rescheduling in Public Bus Transportation, MATCOS-13 Proceedings of the 2013 Mini-Conference on Applied Theoretical Computer Science, pp. 29-33, University of Primorska Press, Koper, 2016. ISBN 978-961-6984-20-1

237. Nur Farraliza Mansor, Abdul Samad Shibghatullah, Amir 'Aatieff Amir Hussin, SM Chit, and Tillal Eldabi, Multi Agent System (MAS) for Bus Driver Duty Reassignment in the Event of Late for Second Piece of Work (LSPW), Journal of Physics: Conference Series, vol. 1529, The 2nd Joint International Conference on Emerging Computing Technology and Sports (JICETS), 2019. 25-27 November 2019, Bandung, Indonesia. DOI: https://doi.org/10.1088/1742-6596/1529/4/042092 *
238. Balázs Dávid, Application-oriented scheduling problems in public bus transportation, PhD Thesis, University of Szeged, Szeged, 2018. http://doktori.bibl.u-szeged.hu/9745/1/thesisDavid.pdf Also in the booklet of theses: http://doktori.bibl.u-szeged.hu/9745/2/booklet.pdf and in the booket of theses in Hungarian: http://doktori.bibl.u-szeged.hu/9745/3/booklet_HUN.pdf
239. Balázs Dávid and Miklós Krész, The dynamic vehice rescheduling problem, Central European Journal of Operations Research, 25(4):809–830, 2017. DOI: 10.1007/s10100-017-0478-7

     [BBDSS15] Balogh, J., J. Békési, Gy. Dósa, J. Sgall, and R. van Stee, The optimal absolute ratio for online bin packing, In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pp. 1425–1438. SIAM, 2015.

240. Rahul Vaze, Online Algorithms, Cambridge University Press, 2023. Online ISBN: 9781009349178 DOI: https://doi.org/10.1017/9781009349178 *
241. Romera-Paredes, B., Barekatain, M., Novikov, A. et al., Mathematical discoveries from program search with large language models. Nature, 625, 468–475, 2024. DOI: https://doi.org/10.1038/s41586-023-06924-6 *
242. Massimo Bertolini, Davide Mezzogori, and Francesco Zammori, Hybrid heuristic for the one-dimensional cutting stock problem with usable leftovers and additional operating constraints, International Journal of Industrial Engineering Computations , 15(1), 149-170, 2024. DOI: 10.5267/j.ijiec.2023.10.006 *
243. Sizhe Li, Jinghui Xue, Mingming Jin, Kai Wang, and Kun He,  A 4-Space Bounded Approximation Algorithm for Online Bin Packing Problem, In: Zhang, Y., Miao, D., Möhring, R. (eds.), Computing and Combinatorics, COCOON 2022. Lecture Notes in Computer Science, vol. 13595, pp. 394–405, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-031-22105-7_35 *
244. Marin Bougeret, György Dósa, Noam Goldberg, and Michael Poss, Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty SIAM Journal on Discrete Mathematics, 36(4):2534-2552, 2022. DOI: 10.1137/21M1457199 URL: https://doi.org/10.1137/21M1457199 Also in: hal-02119351v3, 2020. HAL Id: hal-02119351, https://hal.archives-ouvertes.fr/hal-02119351v3 Preprint submitted on 30 Oct 2020.
245. Bengt J. Nilsson and Gordana Vujovic, Online Two-Dimensional Vector Packing With Advice, In: Calamoneri T., Corò F. (Eds.), Algorithms and Complexity CIAC 2021, LNCS, vol. 12701. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-75242-2_27 * Extended version: arXiv:2204.10322 [cs.DS], 15 pages. DOI: https://doi.org/10.48550/arXiv.2204.10322 *
246. Bakhthemmat, A. and Izadi, M., Solving fully dynamic bin packing problem for virtual machine allocation in the cloud environment by the futuristic greedy algorithm, Journal of Intelligent and Fuzzy Systems, 40(3):4737-4760, 2021. DOI: 10.3233/JIFS-201581 *
247. A. Hanif Halim, I. Ismail, and Swagatam Das, Performance assessment of the metaheuristic optimization algorithms: an exhaustive review, Artificial Intelligence Review, 54, 2323–2409, 2021. DOI: https://doi.org/10.1007/s10462-020-09906-6 *
248. YANG Ting, LUO Fei, DING Wei-chao, and LU Hai-feng, Bin Packing Algorithm Based on Adaptive Optimization of Slack, Computer Science, 2020, 47(4):211-216, 2020. doi: 10.11896/jsjkx.190500132 URL: http://www.jsjkx.com/EN/10.11896/jsjkx.190500132 *
249. Sebastian Berndt, Klaus Jansen, and Kim-Manuel Klein, Fully dynamic bin packing revisited, Mathematical Programming, 179(1–2):109–155, 2020. DOI: https://doi.org/10.1007/s10107-018-1325-x, Springer Berlin Heidelberg. *
250. Varun Gupta and Ana Radovanović, Interior-Point-Based Online Stochastic Bin Packing, Operations Research, 68(5):1474–1492, 2020, INFORMS. https://doi.org/10.1287/opre.2019.1914 [Also available at SSRN: https://ssrn.com/abstract=2673951 or http://dx.doi.org/10.2139/ssrn.2673951 68 pages. Posted: 14 Oct 2015. Last revised: 21 Nov 2019] *
251. Hu, Michael, Leveraging data analytics to improve outpatient healthcare operations, PhD Thesis, Massachusetts Institute of Technology. Operations Research Center. Advisor: Retsef Levi. 2020. https://dspace.mit.edu/handle/1721.1/128043 *
252. Noam Goldberg and Shlomo Karhi, Online packing of arbitrary sized items into designated and multipurpose bins, European Journal of Operational Research, 279(1):54-67, 2019. https://doi.org/10.1016/j.ejor.2019.05.029 *
253. Aniket Basu Roy, Marin Bougeret, Noam Goldberg, and Michael Poss, Approximating Robust Bin Packing with Budgeted Uncertainty, In: Friggstad Z., Sack JR., Salavatipour M. (eds.), Algorithms and Data Structures, WADS 2019. Lecture Notes in Computer Science (LNCS), vol. 11646, pp. 71-84. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-24766-9_6 Also in: HAL archives-ouvertes.fr, HAL Id: hal-02119351 https://hal.archives-ouvertes.fr/hal-02119351/document *
254. Rongqi Li, Zhiyi Tan, and Qianyu Zhu, Batch scheduling of nonidentical job sizes with minsum criteria, Journal of Combinatorial Optimization, Springer, 42(3), 543-564, 2021. https://link.springer.com/article/10.1007%2Fs10878-019-00419-9 DOI: https://doi.org/10.1007/s10878-019-00419-9 *
255. Srikrishnan Divakaran, A Fast Scalable Heuristic for Bin Packing, arXiv:1904.12467 [cs.DS], 29 Apr 2019. https://arxiv.org/abs/1904.12467 *
256. Srikrishnan Divakaran, Fast Approximation Schemes for Bin Packing, arXiv:1902.03422 [cs.DS], 9 Feb 2019. URL: https://arxiv.org/abs/1902.03422 *
257. János Csirik and György Dósa, Performance Guarantees for One Dimensional Bin Packing, In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Methodologies and Traditional Applications (Teofilo F. Gonzalez, Ed.), Chapter 28, CRC Press, 2018. URL: https://www.routledgehandbooks.com/doi/10.1201/9781351236423-28
258. Martin Böhm, György Dósa, Leah Epstein, Jiří Sgall, and Pavel Veselý, Colored Bin Packing: Online Algorithms and Lower Bounds, Algorithmica, 80(1):155-184, 2018. Springer US. DOI: https://doi.org/10.1007/s00453-016-0248-2 Online manuscript: http://iuuk.mff.cuni.cz/~vesely/papers/colbins.pdf
259. Sandy Heydrich, A tale of two packing problems: improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem, Doctoral Thesis, Saarland University, Saarbrücken, 2018. URL: https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/27141 DOI: http://dx.doi.org/10.22028/D291-27240 *
260. Rongqi Li, Zhiyi Tan, and Qianyu Zhu, Minimizing Total Completion Time of Batch Scheduling with Nonidentical Job Sizes, Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Lecture Notes in Computer Science (LNCS), volume 10627 (Eds. Gao Xiaofeng, Du Hongwei, and Han Meng), pp. 165-179, 2017. Springer International Publishing. https://doi.org/10.1007/978-3-319-71150-8_16 DOI: 10.1007/978-3-319-71150-8_16 *
261. Maxence Delorme, Mathematical Models and Decomposition Algorithms for Cutting and Packing Problems, PhD thesis, Alma Mater Studiorum Università di Bologna. Dottorato di ricerca in Automatica e ricerca operativa, 29 Ciclo, 2017. 2017.04.05., DOI: 10.6092/unibo/amsdottorato/7828 URL: http://amsdottorato.unibo.it/id/eprint/7828 ISSN: 2038-7946 *
262. Henrik I. Christensen, Arindam Khan, Sebastian Pokutta, and Prasad Tetali, Approximation and online algorithms for multidimensional bin packing: A survey, Computer Science Review, 24:63-79, 2017. http://www.sciencedirect.com/science/article/pii/S1574013716301356 Manuscript available: Multidimensional bin packing and related problems: a survey, Online URL: https://people.math.gatech.edu/~tetali/PUBLIS/CKPT.pdf *
263. Noam Goldberg and Shlomo Karhi, Packing into Designated and Multipurpose Bins: A Theoretical Study and Application to the Cold Chain, Omega, 71:85-92, 2017. URL: https://doi.org/10.1016/j.omega.2016.09.010 *
264. György Dósa, Tightness results for several variants of the First Fit bin packing algorithm (with help of weighting functions), DSc Dissertation, University of Pannonia, Veszprém, 2016. URL: http://real-d.mtak.hu/978/7/dc_1295_16_doktori_mu.pdf
265. József Békési, György Dósa, Leah Epstein, Bounds for online bin packing with cardinality constraints, Information and Computation, 249(2016):190–204. DOI: 10.1016/j.ic.2016.06.001 URL: https://doi.org/10.1016/j.ic.2016.06.001
266. Maxence Delorme, Manuel Iori, Silvano Martello, Bin packing and cutting stock problems: Mathematical models and exact algorithms, European Journal of Operational Research, 255(1):1–20, 2016. DOI: 10.1016/j.ejor.2016.04.030 * URL: https://doi.org/10.1016/j.ejor.2016.04.030 * Also in: Maxence Delorme, Manuel Iori, and Silvano Martello, Bin Packing and Cutting Stock Problems: Mathematical Models and Exact Algorithms, Research Report OR-15-1, DEI "Guglielmo Marconi", University of Bologna, March 24, 2015. URL: http://or.dei.unibo.it/sites/or.dei.unibo.it/files/Research%20report%20OR-15-1.pdf *
267. Sandy Heydrich and Rob van Stee, Beating the Harmonic lower bound for online bin packing, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), (Eds.: Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi), Article No. 41; pp. 41:1–41:14. Leibniz International Proceedings in Informatics (LIPICS), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, 2016. Online URL: http://www.easyconferences.eu/icalp2016/proceedings/
268. Leah Epstein, More on batched bin packing, Operations Research Letters, 44(2016):273–277. DOI:10.1016/j.orl.2016.02.006 http://dx.doi.org/10.1016/j.orl.2016.02.006 *
269. Lin Chen, Deshi Ye, Guochuan Zhang, An asymptotic competitive scheme for online bin packing, Theoretical Computer Science, 607, 446–454, 2015. DOI: 10.1016/j.tcs.2015.04.038 Online: http://www.sciencedirect.com/science/article/pii/S0304397515005150 *
270. Nicolaos Matsakis, Approximation Algorithms for Packing and Buffering Problems, PhD Thesis, University opf Warwick, 2015. http://wrap.warwick.ac.uk/82141/ *
271. Sandy Heydrich, Rob van Stee, Beating the Harmonic lower bound for online bin packing, arXiv:1511.00876v1 [cs.DS], 3 Nov 2015. http://arxiv.org/abs/1511.00876
272. Arindam Khan, Approximation algorithms for multidimensional bin packing, PhD thesis, School of Computer Science, Georgia Institute of Technology, August 2015. URL: http://www.aco.gatech.edu/doc/khan_thesis.pdf *

     [BBDEKT15] Balogh, J., J. Békési, Gy. Dósa, L. Epstein, H. Kellerer, and Zs. Tuza, Online Results for Black and White Bin Packing, Theory of Computing Systems, 56(1), 137-155, 2015. DOI: 10.1007/s00224-014-9538-8

273. Renan F.F. da Silva, Yulle G. F. Borges, and Rafael C.S. Schouery, Fast neighborhood search heuristics for the colored bin packing problem, 28 pages, Annals of Operations Research, in press, 2024+. DOI: https://doi.org/10.1007/s10479-024-06323-8 *
274. Sara Ali, António Galrão Ramos, Maria Antónia Carravilla, and José Fernando Oliveira, Heuristics for online three-dimensional packing problems and algorithm selection framework for semi-online with full look-ahead, Applied Soft Computing, 151, 111168, 2024. DOI: https://doi.org/10.1016/j.asoc.2023.111168 *
275. Yulle G. F. Borges, Rafael C. S. Schouery, and Flávio K. Miyazawa, Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem, Computers & Operations Research, Volume 164, 106527, 2024. DOI: https://doi.org/10.1016/j.cor.2023.106527 * Also in: arXiv:2305.15291 [math.OC], https://doi.org/10.48550/arXiv.2305.15291 24 May 2023. *
276. Asaf Levin, Comparing the costs of Any Fit algorithms for bin packing, Operations Research Letters, 50(6): 646-649, 2022. DOI: https://doi.org/10.1016/j.orl.2022.09.006 *
277. Arturo Silva-Gálvez, Jorge Orozco-Sanchez, Erick Lara-Cárdenas, José Carlos Ortiz-Bayliss, Ivan Amaya, Jorge M. Cruz-Duarte, and Hugo Terashima-Marín, Discovering Action Regions for Solving the Bin Packing Problem through Hyper-heuristics, 2020 IEEE Symposium Series on Computational Intelligence (SSCI), Canberra, ACT, Australia, 2020, pp. 822-828, IEEE. DOI: 10.1109/SSCI47803.2020.9308538 *
278. Francesco Cellinese, Selfishness and optimization for multi-agent packing and coverage problems, PHD Thesis, GSSI Gran Sasso Sciance Institute, Advisors: Gianlorenzo D'Angelo, Gianpiero Monaco, July 2019, L'Aquila, Italy. http://hdl.handle.net/20.500.12571/9723 https://iris.gssi.it/retrieve/handle/20.500.12571/9723/2459/Cellinese.pdf *
279. Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, and Gianpiero Monaco, Selfish colorful bin packing games, Journal of Combinatorial Optimization, 40, 610–635, 2020. DOI: https://doi.org/10.1007/s10878-020-00599-9 *
280. Noam Goldberg and Shlomo Karhi, Online packing of arbitrary sized items into designated and multipurpose bins, European Journal of Operational Research, 279(1), 54-67, 2019. https://doi.org/10.1016/j.ejor.2019.05.029 *
281. David Bergman, Carlos Cardonha, and Saharnaz Mehrani, Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation, In: Rousseau LM., Stergiou K. (eds), Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2019. Lecture Notes in Computer Science, vol. 11494, Springer, Cham, 2019, pp. 57-66. DOI: https://doi.org/10.1007/978-3-030-19212-9_4 Also in: arXiv preprint arXiv:1812.00059, 2018. URL: https://arxiv.org/abs/1812.00059 *
282. János Csirik and Csanád Imreh, Variants of Classical One Dimensional Bin Packing, In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Methodologies and Traditional Applications (Teofilo F. Gonzalez, Ed.), Chapter 29, CRC Press, 2018. URL: https://www.routledgehandbooks.com/doi/10.1201/9781351236423-29 *
283. Martin Böhm, György Dósa, Leah Epstein, Jiří Sgall, and Pavel Veselý, Colored Bin Packing: Online Algorithms and Lower Bounds, Algorithmica, 80(1):155-184, 2018. Springer US. DOI: https://doi.org/10.1007/s00453-016-0248-2 Online manuscript: http://iuuk.mff.cuni.cz/~vesely/papers/colbins.pdf
284. Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, and Gianpiero Monaco, On Colorful Bin Packing Games, In: Wang L., Zhu D. (Eds.), Computing and Combinatorics, COCOON 2018. Lecture Notes in Computer Science, Vol 10976., Springer, Cham. arXiv preprint arXiv:1711.03570v1 [cs.GT] 9 Nov 2017. https://arxiv.org/abs/1711.03570 *
285. György Dósa, Tightness results for several variants of the First Fit bin packing algorithm (with help of weighting functions), DSc Dissertation, University of Pannonia, Veszprém, 2016. URL: http://real-d.mtak.hu/978/7/dc_1295_16_doktori_mu.pdf
286. Mark Sh. Levin, Towards Bin Packing (preliminary problem survey, models with multiset estimates), arXiv:1605.07574 [cs.AI], 24 May 2016. https://arxiv.org/abs/1605.07574 *
287. Jing Chen, Xin Han, Wolfgang Bein, and Hing-Fung Ting, Black and White Bin Packing Revisited, Combinatorial Optimization and Applications, Lecture Notes in Computer Science, 9486, pp. 45-59, 2015. 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings. *
288. Nicolaos Matsakis, Approximation Algorithms for Packing and Buffering Problems, PhD Thesis, University opf Warwick, 2015. http://wrap.warwick.ac.uk/82141/ *
289. Martin Böhm, György Dósa, Leah Epstein, Jiří Sgall, and Pavel Veselý, Colored bin packing: online algorithms and lower bounds, Proceedings of the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015), La Roche-en-Ardenne, Belgium, 8-12 June 2015, pp. 187-189, 2015. ISBN: 9789081409971
290. Attila Bódis, Bin packing with directed stackability conflicts, Acta Universitatis Sapientiae, Informatica, 7(1), 31–57, 2015. ISSN (Online): 2066-7760, DOI: 10.1515/ausi-2015-0011 *
291. Martin Böhm, Jiří Sgall, and Pavel Veselý, Online colored bin packing, E. Bampis and O. Svensson (Eds.), Proc. of the 12th Workshop on Approximation and Online Algorithms (WAOA 2014), Lecture Notes in Computer Science, Vol. 8952, pp. 35-46, Springer International Publishing Switzerland, 2015. DOI: 10.1007/978-3-319-18263-6_4 Also in: arXiv:1404.5548v1 [cs.DS], 22 Apr 2014. http://arxiv.org/abs/1404.5548 *
292. György Dósa, Leah Epstein, Colorful Bin Packing, Lecture Notes in Computer Science, Vol. 8503, pp. 170-181, 2014. Algorithm Theory – SWAT 2014, 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. (Eds., R. Ravi, Inge Li Gørtz.) ISBN: 978-3-319-08403-9 (Print) 978-3-319-08404-6 (Online) Also in: arXiv:1404.3990v1 [cs.DS], 15 Apr 2014. http://arxiv.org/abs/1404.3990
293. Pavel Veselý, Online algorithms for variants of bin packing, Master thesis, Computer Science Institute of Charles University, Prague, Czech Republic, 2014. Online available: http://iuuk.mff.cuni.cz/~vesely/coloredBP/MgrThesis.pdf *

     [BBDEKLT15] Balogh, J., J. Békési, Gy. Dósa, L. Epstein, H. Kellerer, A. Levin, and Zs. Tuza, Offline Black and White Bin Packing, Theoretical Computer Science, 596(2015), 92–101. DOI: 10.1016/j.tcs.2015.06.045

294. Yulle G. F. Borges, Rafael C. S. Schouery, and Flávio K. Miyazawa, Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem, Computers & Operations Research, Volume 164, 106527, 2024. DOI: https://doi.org/10.1016/j.cor.2023.106527 * Also in: arXiv:2305.15291 [math.OC], https://doi.org/10.48550/arXiv.2305.15291 24 May 2023. *
295. Renan F.F. da Silva, Yulle G. F. Borges, and Rafael C.S. Schouery, Fast neighborhood search heuristics for the colored bin packing problem, 28 pages, Annals of Operations Research, in press, 2024+. DOI: https://doi.org/10.1007/s10479-024-06323-8 Also in: Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem, arXiv:2310.04471 [cs.AI], 6 Oct 2023. DOI: https://doi.org/10.48550/arXiv.2310.04471 *
296. Asaf Levin, Comparing the costs of Any Fit algorithms for bin packing, Operations Research Letters, 50(6): 646-649, 2022. DOI: https://doi.org/10.1016/j.orl.2022.09.006
297. Francesco Cellinese, Selfishness and optimization for multi-agent packing and coverage problems, PHD Thesis, GSSI Gran Sasso Sciance Institute, Advisors: Gianlorenzo D'Angelo, Gianpiero Monaco, July 2019, L'Aquila, Italy. http://hdl.handle.net/20.500.12571/9723 https://iris.gssi.it/retrieve/handle/20.500.12571/9723/2459/Cellinese.pdf *
298. Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, and Gianpiero Monaco, Selfish colorful bin packing games, Journal of Combinatorial Optimization, 40, 610–635, 2020. DOI: https://doi.org/10.1007/s10878-020-00599-9 *
299. Yulle G. F. Borges, Rafael C. S. Schouery, Modelos Pseudo Polinomiais para o Problema do Empacotamento Colorido, In: Encontro de Teoria da Computação (ETC), 5., 2020, Cuiabá. Anais do V Encontro de Teoria da Computação. Porto Alegre: Sociedade Brasileira de Computação, June 2020, pp. 37-40. ISSN 2595-6116. DOI: https://doi.org/10.5753/etc.2020.11084 *
300. János Csirik and Csanád Imreh, Variants of Classical One Dimensional Bin Packing, In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Methodologies and Traditional Applications (Teofilo F. Gonzalez, Ed.), Chapter 29, CRC Press, 2018. URL: https://www.routledgehandbooks.com/doi/10.1201/9781351236423-29 *
301. Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, and Gianpiero Monaco, On Colorful Bin Packing Games, In: Wang L., Zhu D. (Eds.), Computing and Combinatorics, COCOON 2018. Lecture Notes in Computer Science, Vol 10976., Springer, Cham. Also: arXiv preprint arXiv:1711.03570v1 [cs.GT] 9 Nov 2017. https://arxiv.org/abs/1711.03570 *
302. György Dósa, Tightness results for several variants of the First Fit bin packing algorithm (with help of weighting functions), DSc Dissertation, University of Pannonia, Veszprém, 2016. URL: http://real-d.mtak.hu/978/7/dc_1295_16_doktori_mu.pdf
303. Mark Sh. Levin, Towards Bin Packing (preliminary problem survey, models with multiset estimates), arXiv:1605.07574 [cs.AI], 24 May 2016. https://arxiv.org/abs/1605.07574 *
304. Nicolaos Matsakis, Approximation Algorithms for Packing and Buffering Problems, PhD Thesis, University opf Warwick, 2015. http://wrap.warwick.ac.uk/82141/ *

     [BBGR14] Balogh, J., J. Békési, G. Galambos, and G. Reinelt, On-line bin packing with restricted repacking, Journal of Combinatorial Optimization, 27(1), 115-131, 2014.

305. Konstantina Mellou, Marco Molinaro, and Rudy Zhou, The Power of Migrations in Dynamic Bin Packing, Proceedings of the ACM on Measurement and Analysis of Computing Systems, Volume 8, Issue 3, Article No.: 45, Pages 1-28, 2024. DOI: https://doi.org/10.1145/3700435 *
306. Rahul Vaze, Online Algorithms, Cambridge University Press, 2023. Online ISBN: 9781009349178 DOI: https://doi.org/10.1017/9781009349178 *
307. Konstantina Mellou, Marco Molinaro, and Rudy Zhou, The Power of Migrations in Dynamic Bin Packing, arXiv:2408.13178 [cs.DS], 23 Aug 2024. DOI: https://doi.org/10.48550/arXiv.2408.13178 *
308. Célia Escribe, Michael Hu, and Retsef Levi, Competitive Algorithms for the Online Minimum Peak Job Scheduling, Operations Research, Volume 73, Issue 1, Pages 408–423. DOI: https://doi.org/10.1287/opre.2021.0080 *
309. Martín Farach-Colton, Katia Leal, Miguel A. Mosteiro, and Christopher Thraves Caro, Dynamic Windows Scheduling with Reallocation, ACM Journal of Experimental Algorithmics, Volume 26, 2021. Article No.: 1.11, pp 1–19. https://doi.org/10.1145/3462208 *
310. Agostino Mascitti, Tommaso Cucinotta, and Luca Abeni, Combining admission tests for heuristic partitioning of real-time tasks on ARM big.LITTLE multi-processor architecture, Journal of Systems Architecture 119, paper 102229, 2021. DOI: https://doi.org/10.1016/j.sysarc.2021.102229 *
311. Bastian Rieck, Basic Analysis of Bin-Packing Heuristics arXiv:2104.12235 [math.OC], 25 Apr 2021. https://arxiv.org/abs/2104.12235 *
312. Bakhthemmat, A. and Izadi, M., Solving fully dynamic bin packing problem for virtual machine allocation in the cloud environment by the futuristic greedy algorithm, Journal of Intelligent and Fuzzy Systems, 40(3):4737-4760, 2021. DOI: 10.3233/JIFS-201581 *
313. Yanghao Xie, Sheng Wangm, and Binbin Wang, Xie, Y., Wang, S. & Wang, B. Virtual network function placement with bounded migrations, Cluster Computing, 24, 2355–2366, 2021 https://doi.org/10.1007/s10586-021-03266-8 *
314. A. Mascitti, T. Cucinotta, and L. Abeni, Heuristic partitioning of real-time tasks on multi-processors, in Proceedings of the 2020 IEEE 23rd International Symposium on Real-Time Distributed Computing (ISORC), Nashville, Tennessee, USA, 2020 May 19-21, pp. 36-42. DOI: 10.1109/ISORC49007.2020.00015. https://retis.sssup.it/~tommaso/publications/IEEE-ISORC-2020-HEUR.pdf *
315. Guru Guruganesh. Topics in Approximation and Online Algorithms, PhD Thesis, CMU-CS-18-121, August 26, 2018. School of Computer Science, Carnegie Mellon University, Pittsburgh, PA. URL: http://reports-archive.adm.cs.cmu.edu/anon/2018/CMU-CS-18-121.pdf *
316. János Csirik and György Dósa, Performance Guarantees for One Dimensional Bin Packing, In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Methodologies and Traditional Applications (Teofilo F. Gonzalez, Ed.), Chapter 28, CRC Press, 2018. URL: https://www.routledgehandbooks.com/doi/10.1201/9781351236423-28 *
317. David Wajc, Thesis Proposal: Matching Algorithms Under Uncertainty, and Matching Lower Bounds, PhD Thesis Proposal, Carnegie Mellon University, Pittsburgh, 2018. http://halley.exp.sis.pitt.edu/comet/presentColloquium.do?col_id=13465 *
318. Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, and David Wajc, Fully-Dynamic Bin Packing with Little Repacking, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella (Eds.), LIPIcs (Leibniz International Proceedings in Informatics Schloss Dagstuhl), Vol. 107, pp. 51:1–51:24, 2018. Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany. Also: Anupam Gupta, Guru Guruganesh, Amit Kumar, and David Wajc, Fully-Dynamic Bin Packing with Limited Repacking, arXiv:1711.02078 [cs.DS], 6 Nov 2017. https://arxiv.org/abs/1711.02078 And also: Björn Feldkord, Matthias Feldotto, and Sören Riechers, A Tight Approximation for Fully Dynamic Bin Packing without Bundling, arXiv:1711.01231 [cs.DS], 3 Nov 2017. https://arxiv.org/abs/1711.01231 *
319. József Békési and Gábor Galambos, Tight bounds for NF-based bounded-space online bin packing algorithms, Journal of Combinatorial Optimization, 35(2):350–364, 2018. DOI: https://doi.org/10.1007/s10878-017-0175-4
320. Dingju Zhu, Quasi-human seniority-order algorithm for unequal circles packing, Chaos, Solitons and Fractals, 89(2016):506–517. DOI: 10.1016/j.chaos.2016.02.030 Online URL: http://www.sciencedirect.com/science/article/pii/S0960077916300613 *
321. H.B.M. van Delft, Dynamic storage allocation to optimize the utilization of storage capacity and handling efficiency, 73 + IX pages, MSc Thesis. Series Master Theses Operations Management and Logistics, TUE, School of Industrial Engineering. Eindhoven, 2016. https://pure.tue.nl/ws/files/46943907/852833-1.pdf *
322. Galambos Gábor, Versenyképes algoritmusok a diszkrét optimalizálásban, Akadémiai nagydoktori thesis, Szegedi Tudományegyetem, 2016. http://real-d.mtak.hu/931/
323. Feifeng Zheng, Li Luo, and E. Zhang, NF-based algorithms for online bin packing with buffer and bounded item size, Journal of Combinatorial Optimization, 30(2):360–369, 2015. DOI 10.1007/s10878-014-9771-8 *
324. Jing Chen, Xin Han, Kazuo Iwama, Hing-Fung Ting, Online bin packing with (1,1) and (2,R) bins, Journal of Combinatorial Optimization, 30(2):276-298, 2015. DOI: 10.1007/s10878-014-9749-6 *
325. Zoltán Ádám Mann, Approximability of virtual machine allocation: much harder than bin packing (invited paper), Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, June 2-5, 2015, Fukuoka, Japan, pp. 21-30, 2015. Online available: http://www.cs.bme.hu/~mann/publications/Japan-2015/Mann_Japan_2015.pdf *
326. Shahin Kamali, Alternative Approaches for Analysis of Bin Packing and List Update Problems, PhD thesis, Waterloo, Ontario, Canada, 2014. URL: http://hdl.handle.net/10012/8843 *
327. Andres J. Gonzalez, Bjarne E. Helvik, The positive impact of failures on energy efficient virtual machines consolidation, IEEE International Conference on Communications (ICC), 2014, pp. 4307-4312. 10-14 June 2014, Sydney, Australia, IEEE, 2014. DOI: 10.1109/ICC.2014.6883997 *
328. Martín Farach-Colton, Katia Leal, Miguel A. Mosteiro, and Christopher Thraves, Dynamic Windows Scheduling with Reallocation, J. Gudmundsson and J. Katajainen (Eds.): SEA 2014, LNCS 8504, pp. 99–110, 2014. Springer International Publishing Switzerland, 2014. Also in: arXiv:1404.1087 [cs.DS], 3 Apr 2014. http://arxiv.org/abs/1404.1087 *
329. Feifeng Zheng, Li Luo, E. Zhang, NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation, Lecture Notes in Computer Science, Vol. 8287, pp. 25-36, Springer International Publishing Switzerland, 2013. *

     [BB14] Balogh, J. and J. Békési, Driver scheduling for vehicle schedules using a set covering approach: a case study, In ICAI 2014 - 9th International Conference on Applied Informatics, Eger, Hungary, January 29-February 1, 2014.

330. Markó Horváth and Tamás Kis, Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price, Central European Journal of Operations Research, 27(1):39–67, 2019. DOI: https://doi.org/10.1007/s10100-017-0489-4 *
331. Viktor Árgilán and Balázs Dávid, A New Heuristic Approach for the Vehicle and Driver Scheduling Problems, In: StuCoSReC Proceedings of the 2014 1st Student Computer Science Research Conference, Iztok Fister jr. and Andrej Brodnik, (Eds.), University of Primorska Press, Koper, 2014, pp. 13-17. ISBN 978-961-6963-03-9 *

     [ABT14] Árgilán, V.S., J. Balogh, and A. Tóth, The Basic Problem of Vehicle Scheduling Can Be Solved by Maximum Bipartite Matching. In ICAI 2014 - Proceedings of the 9th International Conference on Applied Informatics, Eger, Hungary, Vol. 2. pp. 209-218, 2014. DOI: doi:10.14794/ICAI.9.2014.2.209.

332. Yang Jiang and Tong He, Optimal Charging Scheduling and Management with Bus-Driver-Trip Assignment considering Mealtime Windows for an Electric Bus Line, Complexity, vol. 2022, Article ID 3087279, 19 pages, 2022. DOI: https://doi.org/10.1155/2022/3087279 *
333. Pinzhi Wang, Improving Group Role Assignment Problem By Incremental Assignment Algorithm, MSc Thesis in Computational Sciences, Laurentian University, Sudbury, Ontario, Canada, 2019. Identifier: https://zone.biblio.laurentian.ca/handle/10219/3387 *
334. Balázs Dávid, Application-oriented scheduling problems in public bus transportation, PhD Thesis, University of Szeged, Szeged, 2018. URL: http://doktori.bibl.u-szeged.hu/9745 *

     [ABBD14] Árgilán, V., J. Balogh, J. Békési, B. Dávid, G. Galambos, M. Krész, and A. Tóth, Scheduling problems in the operative planning of public transportation ("Ütemezési feladatok az autóbuszos közösségi közlekedés operatív tervezésében: Egy áttekintés”), Alkalmazott Matematikai Lapok, 31:1–40, 2014. ISSN 0133-3399. (In Hungarian.)

335. Illés Tibor, Molnár-Szipai Richárd, Erősen polinomiális pivot algoritmusok a maximális folyam feladatra, Alkalmazott Matematikai Lapok, 35:145-182, 2018. * URL: aml.math.bme.hu/wp-content/uploads/2019/01/35_Illes_MolnarSzipai.pdf *
336. Balázs Dávid and Miklós Krész, Multi-depot bus schedule assignment with parking and maintenance constraints for intercity transportation over a planning period, Transportation Letters: The International Journal of Transportation Research, 10 pages, 2018. DOI: 10.1080/19427867.2018.1512216 https://doi.org/10.1080/19427867.2018.1512216
337. Balázs Dávid, Application-oriented scheduling problems in public bus transportation, PhD Thesis, University of Szeged, Szeged, 2018. URL: http://doktori.bibl.u-szeged.hu/9745

     [BBDKT13] Balogh, J., J. Békési, Gy. Dosa, H, Kellerer, and Zs. Tuza, Black and white bin packing, In: Thomas Erlebach and Giuseppe Persiano (Eds.), Proc. WAOA 2012 - 10th Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science, Vol. 7846, pp. 131-144. Springer, Heidelberg, 2013.

338. Yulle G. F. Borges, Rafael C. S. Schouery, and Flávio K. Miyazawa, Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem, Computers & Operations Research, Volume 164, 106527, 2024. DOI: https://doi.org/10.1016/j.cor.2023.106527 * Also in: arXiv:2305.15291 [math.OC], https://doi.org/10.48550/arXiv.2305.15291 24 May 2023. *
339. Renan F.F. da Silva, Yulle G. F. Borges, and Rafael C.S. Schouery, Fast neighborhood search heuristics for the colored bin packing problem, 28 pages, Annals of Operations Research, in press, 2024+. DOI: https://doi.org/10.1007/s10479-024-06323-8 * Also in: Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem, arXiv:2310.04471 [cs.AI], 6 Oct 2023. DOI: https://doi.org/10.48550/arXiv.2310.04471 *
340. Yury Kochetov and Arteam Kondakov, A hybrid VSN matheuristic for a bin packing problem with a color constraint, Yugoslav Journal of Operations Research, 2021, Volume 31, Issue 3, pp. 285-298. DOI: https://doi.org/10.2298/YJOR200117009K URL: http://www.yujor.fon.bg.ac.rs/index.php/yujor/article/view/827/743 *
341. Francesco Cellinese, Selfishness and optimization for multi-agent packing and coverage problems, PHD Thesis, GSSI Gran Sasso Sciance Institute, Advisors: Gianlorenzo D'Angelo, Gianpiero Monaco, July 2019, L'Aquila, Italy. http://hdl.handle.net/20.500.12571/9723 https://iris.gssi.it/retrieve/handle/20.500.12571/9723/2459/Cellinese.pdf *
342. Yulle G. F. Borges, Rafael C. S. Schouery, Modelos Pseudo Polinomiais para o Problema do Empacotamento Colorido, In: Encontro de Teoria da Computação (ETC), 5., 2020, Cuiabá. Anais do V Encontro de Teoria da Computação. Porto Alegre: Sociedade Brasileira de Computação, June 2020, pp. 37-40. ISSN 2595-6116. DOI: https://doi.org/10.5753/etc.2020.11084 *
343. David Bergman, Carlos Cardonha, and Saharnaz Mehrani, Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation, In: Rousseau LM., Stergiou K. (eds), Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2019. Lecture Notes in Computer Science, vol. 11494, Springer, Cham, 2019, pp. 57-66. DOI: https://doi.org/10.1007/978-3-030-19212-9_4 Also in: arXiv preprint arXiv:1812.00059, 2018. URL: https://arxiv.org/abs/1812.00059 *
344. János Csirik and Csanád Imreh, Variants of Classical One Dimensional Bin Packing, In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Methodologies and Traditional Applications (Teofilo F. Gonzalez, Ed.), Chapter 29, CRC Press, 2018. URL: https://www.routledgehandbooks.com/doi/10.1201/9781351236423-29 *
345. Artem Kondakov and Yury Kochetov, A Core Heuristic and the Branch-and-Price Method for a Bin Packing Problem with a Color Constraint. In: Eremeev A., Khachay M., Kochetov Y., Pardalos P. (Eds.), OPTA 2018: Optimization Problems and Their Applications, pp. 309-320. Communications in Computer and Information Science, Vol. 871. Springer, Cham, 2018. DOI: https://doi.org/10.1007/978-3-319-93800-4_25 *
346. Martin Böhm, György Dósa, Leah Epstein, Jiří Sgall, and Pavel Veselý, Colored Bin Packing: Online Algorithms and Lower Bounds, Algorithmica, 80(1):155-184, 2018. Springer US. DOI: https://doi.org/10.1007/s00453-016-0248-2 Online manuscript: http://iuuk.mff.cuni.cz/~vesely/papers/colbins.pdf
347. Y. Kochetov and A. Kondakov, VNS matheuristic for a bin packing problem with a color constraint, Electronic Notes in Discrete Mathematics, 58, 39–46, 2017. *
348. A.A. Kondakov, Tocsnüj algoritm resenija zadachi upak ovki v kontejnerü s organichenijami na cveta predmetov (Точный алгоритм решения задачи упак овки в контейнеры с ограничениями на цвета предметов), MSc Thesis (Vüpuszkaja kvalikikacionnaja rabota magistra), Novosibirsk State University, Novosibirsk, Russia, 2017. (in Russian) URL: http://tc.nsu.ru/uploads/b9fcc1732f50c26ce1426f00de076e08.pdf *
349. György Dósa, Tightness results for several variants of the First Fit bin packing algorithm (with help of weighting functions), DSc Dissertation, University of Pannonia, Veszprém, 2016. URL: http://real-d.mtak.hu/978/7/dc_1295_16_doktori_mu.pdf
350. Hamza Alsarhan, Davin Chia, Ananya Christman⋆,Shannia Fu, and Yanfeng Jin, A Two-Pass Algorithm for Unordered Colored Bin Packing, In: A. Kononov et al. (eds.): DOOR 2016, Vladivostok, Russia, 2016, pp. 1-10. URL: http://ceur-ws.org/Vol-1623/ ( Also in: Bin Packing with Multiple Colors, arXiv:1511.04762v1 [cs.DS], 15 Nov 2015. http://arxiv.org/abs/1511.04762 ) *
351. Jing Chen, Xin Han, Wolfgang Bein, and Hing-Fung Ting, Black and White Bin Packing Revisited, Combinatorial Optimization and Applications, Lecture Notes in Computer Science, 9486, pp. 45-59, 2015. 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings. *
352. Martin Böhm, György Dósa, Leah Epstein, Jiří Sgall, and Pavel Veselý, Colored bin packing: online algorithms and lower bounds, Proceedings of the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015), La Roche-en-Ardenne, Belgium, 8-12 June 2015, pp. 187-189, 2015. ISBN: 9789081409971
353. Martin Böhm, Jiří Sgall, and Pavel Veselý, Online colored bin packing, E. Bampis and O. Svensson (Eds.), Proc. of the 12th Workshop on Approximation and Online Algorithms (WAOA 2014), Lecture Notes in Computer Science, Vol. 8952, pp. 35-46, Springer International Publishing Switzerland, 2015. DOI: 10.1007/978-3-319-18263-6_4 Also in: arXiv:1404.5548v1 [cs.DS], 22 Apr 2014. http://arxiv.org/abs/1404.5548 *
354. Nicolaos Matsakis, Approximation Algorithms for Packing and Buffering Problems, PhD Thesis, University of Warwick, 2015. http://wrap.warwick.ac.uk/82141/ *
355. Pavel Veselý, Online algorithms for variants of bin packing, Master thesis, Computer Science Institute of Charles University, Prague, Czech Republic, 2014. Online available: http://iuuk.mff.cuni.cz/~vesely/coloredBP/MgrThesis.pdf *
356. Rob van Stee, SIGACT News Online Algorithms Column 21: APPROX and ALGO, ACM SIGACT News, 43(4), pp. 123-129, 2012. *

     [BB13] Balogh, J. and J. Békési, Semi-on-line bin packing: a short overview and a new lower bound, Central European Journal of Operations Research, 21(4), 685-698, 2013. DOI: 10.1007/s10100-012-0266-3

357. Sara Ali, António Galrão Ramos, Maria Antónia Carravilla, and José Fernando Oliveira, Heuristics for online three-dimensional packing problems and algorithm selection framework for semi-online with full look-ahead, Applied Soft Computing, 151, 111168, 2024. DOI: https://doi.org/10.1016/j.asoc.2023.111168 *
358. Jessica González-San Martín, Laura Cruz-Reyes, Bernabé Dorronsoro, Marcela Quiroz-Castellanos, Héctor Fraire, Claudia Gómez-Santillán, and Nelson Rangel-Valdez, Optimization Models and Methods for Bin Packing Problems: A Case Study on Solving 1D-BPP, In: Castillo, O., Melin, P. (eds) New Perspectives on Hybrid Intelligent System Design based on Fuzzy Logic, Neural Networks and Metaheuristics, Studies in Computational Intelligence (SCI), vol 1050. Springer, Cham, 2022, pp. 265–280 https://doi.org/10.1007/978-3-031-08266-5_17 *
359. Martín Farach-Colton, Katia Leal, Miguel A. Mosteiro, and Christopher Thraves Caro, Dynamic Windows Scheduling with Reallocation, ACM Journal of Experimental Algorithmics, Volume 26, 2021. Article No.: 1.11, pp 1–19. https://doi.org/10.1145/3462208 *
360. YANG Ting, LUO Fei, DING Wei-chao, and LU Hai-feng, Bin Packing Algorithm Based on Adaptive Optimization of Slack, Computer Science, 2020, 47(4):211-216, 2020. doi: 10.11896/jsjkx.190500132 URL: http://www.jsjkx.com/EN/10.11896/jsjkx.190500132 *
361. Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, and Erik Vee, Semi-Online Bipartite Matching, 10th Innovations in Theoretical Computer Science (ITCS 2019), (Avrim Blum, ed.), pp. 50:1–50:20. LIPIcs 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany. DOI: 10.4230/LIPIcs.ITCS.2019.50 Also in: arXiv preprint arXiv:1812.00134, 2018. URL: https://arxiv.org/abs/1812.00134 *
362. János Csirik and György Dósa, Performance Guarantees for One Dimensional Bin Packing, In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Methodologies and Traditional Applications (Teofilo F. Gonzalez, Ed.), Chapter 28, CRC Press, 2018. URL: https://www.routledgehandbooks.com/doi/10.1201/9781351236423-28 *
363. Milan De Cauwer, Combinatorial optimisation for sustainable cloud computing. PhD Thesis, University College Cork, Ireland, 2018. Supervisors: Barry O'Sullivan and Deepak Mehta. xi + 170 pages http://hdl.handle.net/10468/6903 *
364. Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz, Online Bin Packing with Advice, Algorithmica, 74(1), 507-527, 2016. DOI: 10.1007/s00453-014-9955-8 *
365. Jing Chen, Xin Han, Kazuo Iwama, Hing-Fung Ting, Online bin packing with (1,1) and (2,R) bins, Journal of Combinatorial Optimization, 30(2):276-298, 2015. DOI: 10.1007/s10878-014-9749-6 *
366. Martín Farach-Colton, Katia Leal, Miguel A. Mosteiro, and Christopher Thraves, Dynamic Windows Scheduling with Reallocation, J. Gudmundsson and J. Katajainen (Eds.): SEA 2014, LNCS 8504, pp. 99–110, 2014. Springer International Publishing Switzerland, 2014. * Also in: Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, and Christopher Thraves, Dynamic Windows Scheduling with Reallocation, arXiv:1404.1087 [cs.DS], 3 Apr 2014. http://arxiv.org/abs/1404.1087 *
367. Weijia Song, Zhen Xiao, Qi Chen, and Haipeng Luo, Adaptive Resource Provisioning for the Cloud Using Online Bin Packing, IEEE Transactions on Computers, vol. 63, no. 11, Article number 6565979, pp. 2647-2660, 2014. IEEE Computer Society, IEEE. DOI: 10.1109/TC.2013.148 http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6565979&abstractAccess=no&userType=inst *
368. Muntazir M. Mehdi, Sean P. Willems, Online Algorithm Used to Improve US Steel Distributors Yield Performance, Manuscript, Submitted to Manufacturing & Service Operations Management, Online available: http://www.analyticape.com/uploads/msom-11-5-2012.pdf *

     [BBG12] Balogh, J., J. Békési, and G. Galambos, New lower bounds for certain classes of bin packing algorithms, Theoretical Computer Science, 440–441(2012), 1–13.

369. Matthias Gehnen and Andreas Usdenski, Online Bin Packing with Item Size Estimates, arXiv:2505.09321v1 [cs.DS], 14 May 2025. DOI: https://doi.org/10.48550/arXiv.2505.09321 *
370. Liu, Min, Mechanism Design for Zero-Cost Bridge Online Segment with One-Direction Agents Uniform Distribution and Online Single Bin Packing Problem with Predictions, BDEIM '24: Proceedings of the 2024 5th International Conference on Big Data Economy and Information Management, pp. 528 - 532, 2025. ISBN 9798400711862, ACM, New York, NY, USA. DOI: https://doi.org/10.1145/3724154.3724241
371. Leah Epstein, Tighter bounds for the harmonic bin packing algorithm, European Journal of Operational Research, 316(1):72-84, 2024. DOI: https://doi.org/10.1016/j.ejor.2024.01.051 *
372. Junjie Zhu, Research on Bin Packing Problem Based on Supply Chain Economic Efficiency, In: S.H.B.D.M. Zailani et al. (Eds.): Proceedings of the 2023 4th International Conference on Management Science and Engineering Management (ICMSEM 2023), 259, pp. 343–354, 2024. DOI: https://doi.org/10.2991/978-94-6463-256-9_ 37 *
373. Rahul Vaze, Online Algorithms, Cambridge University Press, 2023. Online ISBN: 9781009349178 DOI: https://doi.org/10.1017/9781009349178 *
374. Célia Escribe, Michael Hu, and Retsef Levi, Competitive Algorithms for the Online Minimum Peak Appointment Scheduling (February 17, 2021). Available at SSRN: https://ssrn.com/abstract=3787306 or http://dx.doi.org/10.2139/ssrn.3787306 *
375. Walaa H. El-Ashmawi, Ahmad Salah, Mahmoud Bekhit, Guoqing Xiao, Khalil Al Ruqeishi, and Ahmed Fathalla, An Adaptive Jellyfish Search Algorithm for Packing Items with Conflict, Mathematics 2023, 11, 3219. DOI: https://doi.org/10.3390/math11143219 *
376. Leah Epstein and Loay Mualem,  Online Bin Packing of Squares and Cubes Algorithmica, 85, 1415–1458, 2023. DOI: https://doi.org/10.1007/s00453-022-01078-9 URL: https://link.springer.com/article/10.1007/s00453-022-01078-9 *
377. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, Theoretical Computer Science, 942, 213-229, 2023. DOI: https://doi.org/10.1016/j.tcs.2022.11.034 *
378. Eriny Wessa and Ayman Atia, Parallelization of One Dimensional First Fit Decreasing Algorithm, 16th International Conference on Computer Engineering and Systems (ICCES), 2021, pp. 1-5, IEEE. DOI: https://doi.org/10.1109/ICCES54031.2021.9686107 *
379. Sebastian Walter Perez Salazar, New benchmarking techniques in resource allocation problems: theory and applications in cloud systems, PhD Thesis, Georgia Institute of Technology, 2022. URI: http://hdl.handle.net/1853/67199 *
380. Leah Epstein, Open-end bin packing: New and old analysis approaches, Discrete Applied Mathematics, 321(15):220-239, 2022. DOI: https://doi.org/10.1016/j.dam.2022.07.003 *
381. Bingchen Lin, Jiawei Li, Ruibin Bai, Rong Qu, Tianxiang Cui, and Huan Jin, Identify Patterns in Online Bin Packing Problem: An Adaptive Pattern-Based Algorithm, Symmetry 2022, 14, 1301. (16 pages) https://doi.org/10.3390/sym14071301 *
382. Sebastian Perez-Salazar, Mohit Singh, and Alejandro Toriello, Adaptive Bin Packing with Overflow, Mathematics of Operations Research, 47(4):3317-3356, 2022. DOI: https://doi.org/10.1287/moor.2021.1239 *
383. Loay Mualem, Online bin packing of squares and cubes, MSc Thesis, University of Haifa, Supervised by: Prof. Leah Epstein, 2021. https://www.proquest.com/openview/48b5507ffca5bcfe641d9865270945d8/ *
384. Johanna Gottwald, Evaluation of Reinforcement Learning Algorithms for Online Bin Packing, Master Thesis, Supervisor: Sepp Hochreiter. Linz, Austria, 2021. vii + 87 pages, URL: https://epub.jku.at/obvulihs/content/titleinfo/6996324 *
385. Célia Escribe, Reducing Physician Burnout and Costs in Outpatient Healthcare Settings via Advanced Analytics MSc Thesis, Massachusetts Institute of Technology, Operations Research Center. 2021. URI: https://hdl.handle.net/1721.1/139300 *
386. Pooya Nikbakht, Applications and Extensions of The Bin Packing Problem, MSc-Thesis, University of Manitoba, Winnipeg, Manitoba, Canada. 2021. URI: http://hdl.handle.net/1993/36164 *
387. Leah Epstein, Several methods of analysis for cardinality constrained bin packing, In: Koenemann J., Peis B. (Eds,), Approximation and Online Algorithms. WAOA 2021. Lecture Notes in Computer Science, Vol. 12982, 117-129, 2022. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-92702-8_8 * Also in: arXiv:2107.08725 [cs.DS], 19 Jul 2021. https://arxiv.org/abs/2107.08725 *
388. Shahin Kamali and Pooya Nikbakht, On the Fault-Tolerant Online Bin Packing Problem, In: D’Angelo G., Michail O. (Eds.), Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2021. Lecture Notes in Computer Science, vol 13084. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-93043-1_1 * Also in: arXiv:2107.02922 [cs.DS], 6 Jul 2021. URL: https://arxiv.org/abs/2107.02922 *
389. Eklavya Sharma, Approximation Algorithms for Geometric Packing Problems Thesis, Master of Technology (Research), Computer Science and Automation, Indian Institute of Science, Bangalore, India, 2021. *
390. Leah Epstein and Loay Mualem, Online Bin Packing of Squares and Cubes, In: Lubiw A., Salavatipour M. (Eds.), Algorithms and Data Structures, WADS 2021. Lecture Notes in Computer Science, vol. 12808, 2021. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-83508-8_26 *
391. Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, and Yoshiko Wakabayashi, A tight lower bound for the online bounded space hypercube bin packing problem, DMTCS:8325 - Discrete Mathematics & Theoretical Computer Science, vol. 23:3, 2021, #7 https://doi.org/10.46298/dmtcs.8325 Source: arXiv:2107.14161v2 [math.CO], 7 Sep 2021. https://arxiv.org/pdf/2107.14161v2.pdf *
392. Hiroshi Fujiwara, Ken Endo, and Hiroaki Yamamoto, Analysis of Lower Bounds for Online Bin Packing with Two Item Sizes, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2021+. Article ID: 2020DMP0007. DOI: https://doi.org/10.1587/transfun.2020DMP0007 *
393. Bengt J. Nilsson and Gordana Vujovic, Online Two-Dimensional Vector Packing With Advice, In: Calamoneri T., Corò F. (Eds.), Algorithms and Complexity CIAC 2021, LNCS, vol. 12701. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-75242-2_27 * Extended version: arXiv:2204.10322 [cs.DS], 15 pages. DOI: https://doi.org/10.48550/arXiv.2204.10322 [ Ref. to the arXiv-version of our paper. ] *
394. Abdelilah Khabir, Zoubir EL Felsoufi, and Hamid Azzouzi, Optimization of the Allocation of Material Resources in a Production Line: Workstation Load Balancing by Analogy with the Bin Packing Problem, Turkish Journal of Computer and Mathematics Education, 12(5):1015-1021, 2021. https://doi.org/10.17762/turcomat.v12i5.1745 *
395. Bakhthemmat, A. and Izadi, M., Solving fully dynamic bin packing problem for virtual machine allocation in the cloud environment by the futuristic greedy algorithm, Journal of Intelligent and Fuzzy Systems, 40(3):4737-4760, 2021. DOI: 10.3233/JIFS-201581 *
396. Hiroshi Fujiwara, Yuta Wanikawa,and Hiroaki Yamamoto, Asymptotic Approximation Ratios for Certain Classes of Online Bin Packing Algorithms, IEICE Transactions on Information and Systems, Vol. E104–D, No. 3, pp. 362-369, 2021. https://doi.org/10.1587/transinf.2020FCP0004 https://www.jstage.jst.go.jp/article/transinf/E104.D/3/E104.D_2020FCP0004/_pdf/
397. Spyros Angelopoulos, Shahin Kamali, and Kimia Shadkami, Online Bin Packing with Predictions, arXiv:2102.03311v1 [cs.DS], 5 Feb 2021, https://arxiv.org/pdf/2102.03311.pdf *
398. Graham Cormode and Pavel Veselý, Streaming Algorithms for Bin Packing and Vector Scheduling, Theory of Computing Systems, 65:916–942, 2021. DOI: https://doi.org/10.1007/s00224-020-10011-y URL: https://link.springer.com/article/10.1007/s00224-020-10011-y *
399. Patryk Mikos, Geometric and weight constraints in Online Interval Coloring, PhD dissertation, Supervisor: Paweł Idziak, Co-supervisor: Grzegorz Gutowski, Jagiellonian University, Kraków, Poland, 2020. https://ruj.uj.edu.pl/xmlui/bitstream/handle/item/277203/mikos_geometric_and_weight_constraints_2020.pdf *
400. Leah Epstein and Asaf Levin, A note on a variant of the online open end bin packing problem, Operations Research Letters, 48(6):844-849, 2020. DOI: https://doi.org/10.1016/j.orl.2020.10.006 *
401. Nikhil Bansal and Ilan Reuven Cohen, An Asymptotic Lower Bound for Online Vector Bin Packing, arXiv:2007.15709v2 [cs.DS], 4 Aug 2020. https://arxiv.org/abs/2007.15709 *
402. Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen and Ingmar Knof, Robust Online Algorithms for Certain Dynamic Packing Problems. In: Bampis E., Megow N. (eds) Approximation and Online Algorithms. WAOA 2019. Lecture Notes in Computer Science, vol 11926, pp. 43-59, 2020. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-39479-0_4 *
403. Graham Cormode and Pavel Veselý, Streaming Algorithms for Bin Packing and Vector Scheduling, In: Bampis E., Megow N. (eds) Approximation and Online Algorithms. WAOA 2019. Lecture Notes in Computer Science, vol 11926, pp. 72-88, 2020. Springer, Cham. DOI: https://doi.org/10.1007/978-3-030-39479-0_6 Also in: Streaming Algorithms for Bin Packing and Vector Scheduling, arXiv:1905.04897 [cs.DS], 13 May 2019. https://arxiv.org/abs/1905.04897 *
404. LUO Fei, REN Qiang, DING Wei-chao, and LU Hai-feng, Heuristic One-dimensional Bin Packing Algorithm Based on Minimum Slack, Computer Science, 46(9):315-320, 2019. doi: 10.11896/j.issn.1002-137X.2019.09.048 URL: http://www.jsjkx.com/EN/10.11896/j.issn.1002-137X.2019.09.048 *
405. Chuanyou Li and Xueyan Tang, On Fault-Tolerant Bin Packing for Online Resource Allocation, in IEEE Transactions on Parallel and Distributed Systems, vol. 31, no. 4, pp. 817-829, 2019. DOI: 10.1109/TPDS.2019.2948327 URL: https://ieeexplore.ieee.org/document/8877781 *
406. Yossi Azar and Danny Vainstein, Tight Bounds for Clairvoyant Dynamic Bin Packing Journal ACM Transactions on Parallel Computing (TOPC), 6(3), 2019, Article No. 15, ACM New York, NY, USA DOI: 10.1145/3364214 *
407. Walaa H. El-Ashmawi and Diaa Salama AbdElminaam, A modified squirrel search algorithm based on improved best fit heuristic and operator strategy for bin packing problem, Applied Soft Computing, 82, 105565, 2019. https://doi.org/10.1016/j.asoc.2019.105565 *
408. Leah Epstein, A lower bound for online rectangle packing, Journal of Combinatorial Optimization, 38(3): 846–866, 2019. DOI: https://doi.org/10.1007/s10878-019-00423-z URL: https://link.springer.com/article/10.1007/s10878-019-00423-z Also in: arXiv:1811.09573, 23 Nov 2018. https://arxiv.org/abs/1811.09573 *
409. Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, and Adi Rosén, Online Bin Packing with Advice of Small Size, Theory of Computing Systems, 62, 2006–2034, 2018. https://doi.org/10.1007/s00224-018-9862-5 *
410. Guru Guruganesh. Topics in Approximation and Online Algorithms, PhD Thesis, CMU-CS-18-121, August 26, 2018. School of Computer Science, Carnegie Mellon University, Pittsburgh, PA. URL: http://reports-archive.adm.cs.cmu.edu/anon/2018/CMU-CS-18-121.pdf *
411. János Csirik and György Dósa, Performance Guarantees for One Dimensional Bin Packing, In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Methodologies and Traditional Applications (Teofilo F. Gonzalez, Ed.), Chapter 28, CRC Press, 2018. URL: https://www.routledgehandbooks.com/doi/10.1201/9781351236423-28 *
412. György Dósa and Leah Epstein, The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints, Journal of Computer and System Sciences, 96:33-49, 2018. DOI: https://doi.org/10.1016/j.jcss.2018.03.004 *
413. David Wajc, Thesis Proposal: Matching Algorithms Under Uncertainty, and Matching Lower Bounds, PhD Thesis Proposal, Carnegie Mellon University, Pittsburgh, 2018. http://halley.exp.sis.pitt.edu/comet/presentColloquium.do?col_id=13465 *
414. Sandy Heydrich, A tale of two packing problems: improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem, Doctoral Thesis, Saarland University, Saarbrücken, 2018. URL: https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/27141 DOI: http://dx.doi.org/10.22028/D291-27240 *
415. Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, and David Wajc, Fully-Dynamic Bin Packing with Little Repacking, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella (Eds.), LIPIcs (Leibniz International Proceedings in Informatics Schloss Dagstuhl), Vol. 107, pp. 51:1–51:24, 2018. Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany. Also: Anupam Gupta, Guru Guruganesh, Amit Kumar, and David Wajc, Fully-Dynamic Bin Packing with Limited Repacking, arXiv:1711.02078 [cs.DS], 6 Nov 2017. https://arxiv.org/abs/1711.02078 And also: Björn Feldkord, Matthias Feldotto, and Sören Riechers, A Tight Approximation for Fully Dynamic Bin Packing without Bundling, arXiv:1711.01231 [cs.DS], 3 Nov 2017. https://arxiv.org/abs/1711.01231 *
416. Martin Böhm, György Dósa, Leah Epstein, Jiří Sgall, and Pavel Veselý, Colored Bin Packing: Online Algorithms and Lower Bounds, Algorithmica, 80(1):155-184, 2018. Springer US. DOI: https://doi.org/10.1007/s00453-016-0248-2 Online manuscript: http://iuuk.mff.cuni.cz/~vesely/papers/colbins.pdf *
417. József Békési and Gábor Galambos, Tight bounds for NF-based bounded-space online bin packing algorithms, Journal of Combinatorial Optimization, 35(2):350–364, 2018. DOI: https://doi.org/10.1007/s10878-017-0175-4
418. Sandy Heydrich, Rob van Stee, Beating the Harmonic lower bound for online bin packing, arXiv:1511.00876v6 [cs.DS], 44 pages, http://arxiv.org/abs/1511.00876 *
419. Seunghwan Yoo and Sungchun Kim, Cost-based Competitive Analysis for Cloud Platform Service Using Online Dynamic Bin Packing, International Journal of Advanced Research in Computer Science & Technology (IJARCST 2017), 5(4):37-44, 2017. *
420. X. Zhao, X. Li, and H. Shen, Improved Online Algorithms for One-Dimensional Bin Packing with Advice, 2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), Taipei, Taiwan, 18-20 Dec. 2017, pp. 211-216. Publisher: IEEE DOI: 10.1109/PDCAT.2017.00042 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8327090&isnumber=8326788 *
421. Kim-Manuel Klein, About the Structure and Sensitivity of Integer Linear Programs and their Application in Combinatorial Optimization, PhD Thesis (Dissertation Dr.-Ing.), Technischen Fakultat, Christian-Albrechts-Universitat zu Kiel, Kiel, Germany, 2017. 2017.04.19., URL: http://macau.uni-kiel.de/receive/dissertation_diss_00021166?lang=en *
422. Yossi Azar and Danny Vainstein, Tight Bounds for Clairvoyant Dynamic Bin Packing, SPAA '17 Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 77-86, Washington, DC, USA, July 24-26, 2017. ACM New York, NY, USA, 2017. ISBN: 978-1-4503-4593-4 DOI: 10.1145/3087556.3087570 *
423. Chuanyou Li and Xueyan Tang, Brief Announcement: Towards Fault-Tolerant Bin Packing for Online Cloud Resource Allocation, SPAA '17 Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 231-233, Washington, DC, USA, July 24-26, 2017. ACM New York, NY, USA, 2017. ISBN: 978-1-4503-4593-4 DOI: 10.1145/3087556.3087596 *
424. Klaus Jansen, Kim-Manuel Klein, Maria Kosche, and Leon Ladewig, Online Strip Packing with Polynomial Migration, Proceedings of Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques (APPROX/RANDOM 2017), Leibniz International Proceedings in Informatics (LIPIcs) Vol. 81, pp. 13:1--13:18, 2017. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.13 URL: http://drops.dagstuhl.de/opus/volltexte/2017/7562/ * Manuscript: arXiv:1706.04939 [cs.DS], 15 Jun 2017. https://arxiv.org/abs/1706.04939 *
425. Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, and Jesper W. Mikkelsen, Online Algorithms with Advice: A Survey, Journal ACM Computing Surveys (CSUR), 50(2), 2017, Article No. 19, ACM New York, NY, USA DOI: 10.1145/3056461 *
426. György Dósa, Batched bin packing revisited, Journal of Scheduling, 20(2):199-209, 2017. DOI: 10.1007/s10951-015-0431-3 Online available: http://link.springer.com/article/10.1007/s10951-015-0431-3 *
427. Henrik I. Christensen, Arindam Khan, Sebastian Pokutta, and Prasad Tetali, Approximation and online algorithms for multidimensional bin packing: A survey, Computer Science Review, 24:63-79, 2017. http://www.sciencedirect.com/science/article/pii/S1574013716301356 Manuscript available: Multidimensional bin packing and related problems: a survey, Online URL: https://people.math.gatech.edu/~tetali/PUBLIS/CKPT.pdf *
428. Minghui Zhang, Xin Han, Yan Lan, and Hing-Fung Ting, Online bin packing problem with buffer and bounded size revisited, Journal of Combinatorial Optimization, 33(2):530–542, 2017. DOI: 10.1007/s10878-015-9976-5 Online URL: link.springer.com/article/10.1007/s10878-015-9976-5 *
429. Mauro Maria Baldi, Luigi De Giovanni, Guido Perboli, and Roberto Tadei, The Generalized Bin Packing Problem with Bin-Dependent Item Profits, CIRRELT-2017-01, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Canada, https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2017-01.pdf *
430. György Dósa, Tightness results for several variants of the First Fit bin packing algorithm (with help of weighting functions), DSc Dissertation, University of Pannonia, Veszprém, 2016. URL: http://real-d.mtak.hu/978/7/dc_1295_16_doktori_mu.pdf *
431. Christian Kudahl, On the Nature of Online Computation, PhD Thesis (Supervised by Joan Boyar and Lene Monrad Favrholdt), Department of Mathematics and Computer Science, University of Southern Denmark, Denmark, 2016. URL: http://www.imada.sdu.dk/~kudahl/phd.pdf *
432. Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, and Jesper W. Mikkelsen, Online Algorithms with Advice: A Survey, ACM SIGACT News, 47(3), 93-129, 2016. ACM New York, NY, USA. DOI: 10.1145/2993749.2993766 *
433. József Békési, György Dósa, Leah Epstein, Bounds for online bin packing with cardinality constraints, Information and Computation, 249(2016):190–204. DOI: 10.1016/j.ic.2016.06.001 Online URL: http:// dx.doi.org/10.1016/j.ic.2016.06.001
434. Galambos Gábor, Versenyképes algoritmusok a diszkrét optimalizálásban, Akadémiai nagydoktori thesis, Szegedi Tudományegyetem, 2016. http://real-d.mtak.hu/931/
435. Imreh Csanád, Online algoritmusok versenyképességi elemzése, Akadémiai nagydoktori thesis, Szegedi Tudományegyetem, 2016. http://real-d.mtak.hu/884/1/ImrehCsanad_tezisek.pdf *
436. József Békési and Gábor Galambos, Tight Online Bin Packing Algorithm with Buer and Parametric Item Sizes, Proceedings of the 19th International Multiconference INFORMATION SOCIETY - IS 2016, Volume H, Middle-European Conference on Applied Theoretical Computer Science (MATCOS 2016), Andrej Brodnik (Ed.), pp. 48-50. 12-13 October 2016, Ljubljana, Slovenia. http://matcos16.iam.upr.si/en/ resources/files/published-material/-h---zbornik.pdf
437. Iványi Antal (szerk.), Informatikai algoritmusok, 2. kötet. Párhuzamos módszerek és optimalizáció, Bővített és javított második kiadás, Hountler Kft., Budapest, 2015. Online URL: http://real.mtak.hu/21565/13/Infalg2a-f17.pdf *
438. Leah Epstein, More on batched bin packing, Operations Research Letters, 44(2016):273–277. DOI:10.1016/j.orl.2016.02.006 http://dx.doi.org/10.1016/j.orl.2016.02.006 *
439. Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz, Online Bin Packing with Advice, Algorithmica, 74(1), 507-527, 2016. DOI: 10.1007/s00453-014-9955-8 *
440. Shahin Kamali, Efficient Bin Packing Algorithms for Resource Provisioning in the Cloud, International Workshop on Algorithmic Aspects of Cloud Computing, ALGOCLOUD 2015 (in ALGO 2015), 2015. Algorithmic Aspects of Cloud Computing, Lecture Notes in Computer Science, 95011, 84-98, 2016. DOI: 10.1007/978-3-319-29919-8_7 URL: http://link.springer.com/chapter/10.1007/978-3-319-29919-8_7 Manuscript online available: http://supertech.csail.mit.edu/papers/ShahinAlgoCloud15.pdf *
441. Jing Chen, Xin Han, Wolfgang Bein, and Hing-Fung Ting, Black and White Bin Packing Revisited, Combinatorial Optimization and Applications, Lecture Notes in Computer Science, 9486, pp. 45-59, 2015. 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings. *
442. Shahin Kamali, Alejandro López-Ortiz, All-Around Near-Optimal Solutions for the Online Bin Packing Problem, Lecture Notes in Computer Science 9472, pp. 727-739, 2015. 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings. *
443. Marc P. Renault, Adi Rosén, and Rob van Stee, Online algorithms with advice for bin packing and scheduling problems, Theoretical Computer Science, 600(2015), 155–170. http://dx.doi.org/10.1016/j.tcs.2015.07.050 Also in: Marc P. Renault, Adi Rosén, and Rob van Stee, Online Algorithms with Advice for Bin Packing and Scheduling Problems, 15 pages, arXiv:1311.7589v1 [cs.DS], 29 Nov 2013. http://arxiv.org/abs/1311.7589 *
444. Andrew Twigg, Eduardo C. Xavier, Locality-preserving allocations problems and coloured bin packing, Theoretical Computer Science, 596, 12-22, 2015. DOI: 10.1016/j.tcs.2015.06.036 URL: http://www.sciencedirect.com/science/article/pii/S0304397515005460 *
445. Ye Yuan, Yi-jun Li, A Heuristic Algorithm for Solving the Bin Packing Problem with Conflicts, Operations Research and Management Science, 24(2):51-57, 2015. URL: http://www.cqvip.com/qk/85032x/201502/664644831.html *
446. Ming Hour Yang, Jia Ning Luo, and Shao Yong Lu, A Novel Multilayered RFID Tagged Cargo Integrity Assurance Scheme, Sensors, 2015, 15, 27087-27115. DOI: 10.3390/s151027087 ISSN 1424-8220 www.mdpi.com/journal/sensors *
447. Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc Renault, and Adi Rosén, Online Bin Packing with Advice of Small Size, In: Algorithms and Data Structures 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015, Proceedings (Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege, Eds.), LNCS 9214, pp. 40-53, 2015. Springer International Publishing Switzerland. DOI: 10.1007/978-3-319-21840-3_4 URL: http://link.springer.com/chapter/10.1007/978-3-319-21840-3_4 *
448. Hiroshi Fujiwara, Koji Kobayashi, Improved lower bounds for the online bin packing problem with cardinality constraints, Journal of Combinatorial Optimization, 29(1):67-87, 2015. DOI: 10.1007/s10878-013-9679-8 *
449. AbdolahadNoori Zehmakan, Bin Packing Problem: Two Approximation Algorithms, International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 5, No. 4, 2015. 11 pages. DOI: 10.5121/ijfcst.2015.5401 URL: http://airccse.org/journal/ijfcst/papers/5415ijfcst01.pdf *
450. Martin Böhm, Jiří Sgall, and Pavel Veselý, Online colored bin packing, E. Bampis and O. Svensson (Eds.), Proc. of the 12th Workshop on Approximation and Online Algorithms (WAOA 2014), Lecture Notes in Computer Science, Vol. 8952, pp. 35-46, Springer International Publishing Switzerland, 2015. DOI: 10.1007/978-3-319-18263-6_4 Also in: arXiv:1404.5548v1 [cs.DS], 22 Apr 2014. http://arxiv.org/abs/1404.5548 *
451. Shahin Kamali and Alejandro López-Ortiz, Efficient Online Strategies for Renting Servers in the Cloud, SOFSEM 2015: Theory and Practice of Computer Science, Lecture Notes in Computer Science, Vol. 8939, pp. 277-288, Springer, Berlin, Heidelberg, 2015. DOI: 10.1007/978-3-662-46078-8_23 ( Also in: arXiv:1408.4156v1 [cs.DS], 18 Aug 2014. http://arxiv.org/abs/1408.4156 ) *
452. Leah Epstein, Bin Packing, Variants. In: Ming-Yang Kao (Ed.), Encyclopedia of Algorithms, Springer US, 2014, pp. 1-3. DOI: 10.1007/978-3-642-27848-8_491-1 ISBN: 978-3-642-27848-8 (Online) *
453. Leah Epstein, Harmonic Algorithm for Bin Packing. In: Ming-Yang Kao (Ed.), Encyclopedia of Algorithms, Springer US, 2014, pp. 1-4. DOI: 10.1007/978-3-642-27848-8_490-1 ISBN: 978-3-642-27848-8 (Online) *
454. Hiroshi Fujiwara, Koji M. Kobayashi, Bin Packing with Cardinality Constraints. In: Ming-Yang Kao (Ed.), Encyclopedia of Algorithms, Springer US, 2014, pp. 1-3. DOI: 10.1007/978-3-642-27848-8_489-1 ISBN: 978-3-642-27848-8 (Online) *
455. Rob van Stee, Current Champion for Online Bin Packing. In: Ming-Yang Kao (Ed.), Encyclopedia of Algorithms, Springer US, 2014, pp. 1-3. DOI: 10.1007/978-3-642-27848-8_497-1 ISBN: 978-3-642-27848-8 (Online) *
456. Rob van Stee, Lower Bounds for Online Bin Packing. In: Ming-Yang Kao (Ed.), Encyclopedia of Algorithms, Springer US, 2014, pp. 1-3. DOI: 10.1007/978-3-642-27848-8_493-1 ISBN: 978-3-642-27848-8 (Online) *
457. Ye Yuan, Yi-jun Li, Yan-king Wang, An improved ACO algorithm for the bin packing problem with conflicts based on graph coloring model, 2014 International Conference on Management Science & Engineering (ICMSE), 17-19 Aug. 2014, Helsinki, Finland, IEEE, pp. 3-9. ISBN: 978-1-4799-5375-2 DOI: 10.1109/ICMSE.2014.6930200 *
458. Nathalie Clement, Planification et affectation de ressources dans les réseaux de soin: analogie avec le problème du bin packing, proposition de méthodes approchées, Thèse Docteur d’université, Université Blaise Pascal, Clermont-Ferrand II, 04 Décembre 2014, xx + 184 pages. (in French) URL: http://fc.isima.fr/~klement/pj/these.pdf *
459. Mihai Burcea, Online Dynamic Bin Packing, PhD Thesis, University of Liverpool, 2014, 116 pages. URL: http://repository.liv.ac.uk/id/eprint/2005382 *
460. Marc P. Renault, Lower and Upper Bounds for Online Algorithms with Advice, PhD Thesis -- Université Paris Diderot - Paris 7, 2014. URL: http://www-desir.lip6.fr/~renaultm/papers/renaultPhD.pdf *
461. Shahin Kamali, Alternative Approaches for Analysis of Bin Packing and List Update Problems, PhD thesis, Waterloo, Ontario, Canada, 2014. URL: http://hdl.handle.net/10012/8843 *
462. György Dósa, Leah Epstein, Colorful Bin Packing, Lecture Notes in Computer Science, Vol. 8503, pp. 170-181, 2014. Algorithm Theory – SWAT 2014, 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. (Eds., R. Ravi, Inge Li Gørtz.) ISBN: 978-3-319-08403-9 (Print) 978-3-319-08404-6 (Online) Also in: arXiv:1404.3990v1 [cs.DS], 15 Apr 2014. http://arxiv.org/abs/1404.3990 *
463. Khuzaima Daudjee, Shahin Kamali, Alejandro López-Ortiz, On the Online Fault-Tolerant Server Consolidation Problem, SPAA '14 Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 12-21, SPAA’14, June 23–25, 2014, Prague, Czech Republic. ACM New York, NY, USA, 2014. ISBN: 978-1-4503-2821-0 DOI: 10.1145/2612669.2612686 *
464. Xiaofan Zhao, Hong Shen, On the Advice Complexity of One-Dimensional Online Bin Packing, Frontiers in Algorithmics, Lecture Notes in Computer Science, Vol. 8497, pp. 320-329, 2014. *
465. Gyorgy Dosa, Zhiyi Tan, Zsolt Tuza, Yujie Yan, and Cecília Sik Lányi, Improved bounds for batch scheduling with nonidentical job sizes, Naval Research Logistics, 61(5):351–358, 2014. DOI: 10.1002/nav.21587 *
466. Pavel Veselý, Online algorithms for variants of bin packing, Master thesis, Computer Science Institute of Charles University, Prague, Czech Republic, 2014. Online available: http://iuuk.mff.cuni.cz/~vesely/coloredBP/MgrThesis.pdf *
467. György Dósa and Leah Epstein, Online bin packing with cardinality constraints revisited, arXiv:1404.1056v1 [cs.DS], 3 Apr 2014. http://arxiv.org/abs/1404.1056 *
468. Joan Boyar, Shahin Kamali, Kim S. Larsen, and Alejandro López-Ortiz, Online Bin Packing with Advice, 31st Symposium on Theoretical Aspects of Computer Science (STACS’14), Ernst W. Mayr and Natacha Portier (Eds.), ISBN 978-3-939897-65-1, LIPICS – Vol. 25, pp. 174–186. DOI: 10.4230/LIPIcs.STACS.2014.174 Also in: arXiv:1212.4016v1 [cs.DS], 17 Dec 2012. http://arxiv.org/abs/1212.4016v1 **
469. Hiroshi Fujiwara, Koji Kobayashi, Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints, Computing and Combinatorics, Lecture Notes in Computer Science, Vol. 7936, pp. 518-530, 2013. DOI: 10.1007/978-3-642-38768-5_46 *

     [ABBD12] Árgilán, V., J. Balogh, J. Békési, B. Dávid, M. Krész, and A. Tóth, Driver scheduling based on driver-friendly vehicle schedules, Proceedings of OR 2011 International Conference on Operations Research, pp. 323-328, Springer-Verlag, 2012.

470. Kisielewski, P., Duda, J., Karkula, M.,Skalna, I., Redmer, A., Fierek, S., Optimization of urban transport vehicle tasks for large, mixed fleet of vehicles and real-world constraints, Archives of Transport, 70(2), 65-78, 2024. DOI: https://doi.org/10.61089/aot2024.qnwb3h25 *
471. Boris Amberg, Ressourceneinsatzplanung im öffentlichen Personennahverkehr: Ähnlichkeitsaspekte in der fahrplanübergreifenden Optimierung, PhD Dissertation, Universitat Paderborn, 2014. http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1384943 *
472. Balázs Dávid, Application-oriented scheduling problems in public bus transportation, PhD Thesis, University of Szeged, Szeged, 2018. URL: http://doktori.bibl.u-szeged.hu/9745/1/thesisDavid.pdf Also in the booklet of theses: http://doktori.bibl.u-szeged.hu/9745/2/booklet.pdf and in the booket of theses in Hungarian: http://doktori.bibl.u-szeged.hu/9745/3/booklet_HUN.pdf
473. B. Dávid and M. Krész, Application Oriented Variable Fixing Methods for the Multiple Depot Vehicle Scheduling Problem, Acta Cybernetica-Szeged, 21(1):53-73, 2013.

     [BBG11] Balogh, J., J. Békési, and G. Galambos, New Lower Bounds for Certain Classes of Bin Packing Algorithms, In Klaus Jansen and Roberto Solis-Oba, editors, Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers, volume 6534 of Lecture Notes in Computer Science, pp. 25-36, Springer, 2011.

474. Konstantina Mellou, Marco Molinaro, and Rudy Zhou, The Power of Migrations in Dynamic Bin Packing, Proceedings of the ACM on Measurement and Analysis of Computing Systems, Volume 8, Issue 3, Article No.: 45, Pages 1-28, 2024. DOI: https://doi.org/10.1145/3700435 *
475. Konstantina Mellou, Marco Molinaro, and Rudy Zhou, The Power of Migrations in Dynamic Bin Packing, arXiv:2408.13178 [cs.DS], 23 Aug 2024. DOI: https://doi.org/10.48550/arXiv.2408.13178 *
476. Jörg Reutershan, Christian Rupprecht, and Thomas Rupprecht, Operating room scheduling: knowing and accepting your limits, British Journal of Anaesthesia, 132(6):1334-1335, 2024. DOI: https://doi.org/10.1016/j.bja.2024.03.006 *
477. Aniket Murhekar, David Arbour, Tung Mai, and Anup Rao, Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud, arXiv:2304.08648v1 [cs.DS], 17 Apr 2023. DOI: https://doi.org/10.48550/arXiv.2304.08648 URL: https://arxiv.org/abs/2304.08648 *
478. Hemanta Kumar Bhuyan and Subhendu Kumar Pani, "10 Cloud Resource Management for Network Cameras" (Chapter 10), in Applications of Machine Learning in Big-Data Analytics and Cloud Computing, River Publishers, 2021, pp. 207-229. *
479. Sebastian Berndt, Klaus Jansen, and Kim-Manuel Klein, Fully dynamic bin packing revisited, Mathematical Programming, 179(1–2):109–155, 2020. DOI: https://doi.org/10.1007/s10107-018-1325-x, Springer Berlin Heidelberg. *
480. Austin Halper, Miguel A. Mosteiro, Yulia Rossikova, and Prudence W. H. Wong, Station Assignment with Reallocation, Algorithmica, 81(3):1096–1125, 2019. DOI: https://doi.org/10.1007/s00453-018-0459-9 Also: arXiv:1803.01276 [cs.DS], 32 pages, 4 Mar 2018, https://arxiv.org/abs/1803.01276 *
481. Y. Kohayakawa, F. K. Miyazawa, and Y. Wakabayashi, A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game, In: Bender M., Farach-Colton M., Mosteiro M. (eds), Latin American Symposium on Theoretical Informatics, LATIN 2018, LNCS 10807. Springer, Cham, 2018, 697-711. DOI: https://doi.org/10.1007/978-3-319-77404-6_51 https://link.springer.com/chapter/10.1007/978-3-319-77404-6_51 Manuscript: arXiv:1712.06763 [cs.DS], 19 Dec 2017. https://arxiv.org/abs/1712.06763 *
482. Minghui Zhang and Xin Han, Research on Online Bin Packing Model with Item Size No More than 1/2, J. Sys. Sci. & Math. Scis. 37(3):781–791, 2017. *
483. Runtian Ren, Xueyan Tang, Yusen Li, and Wentong Cai, Competitiveness of Dynamic Bin Packing for Online Cloud Server Allocation, IEEE/ACM Transactions on Networking, 25(3):1324-1331, 2017. IEEE. DOI: 10.1109/TNET.2016.2630052 URL: http://ieeexplore.ieee.org/document/7778998 *
484. David Blitz, Sandy Heydrich, Rob van Stee, André van Vliet, and Gerhard J. Woeginger, Improved Lower Bounds for Online Hypercube and Rectangle Packing, arXiv:1607.01229v2 [cs.DS], 6 Nov 2017. https://arxiv.org/abs/1607.01229v2 *
485. Sandy Heydrich and Rob van Stee, Beating the Harmonic lower bound for online bin packing, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), (Eds.: Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi), Article No. 41; pp. 41:1–41:14. Leibniz International Proceedings in Informatics (LIPICS), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, 2016. Online URL: http://www.easyconferences.eu/icalp2016/proceedings/ *
486. Xueyan Tang, Yusen Li, Runtian Ren, and Wentong Cai, On First Fit Bin Packing for Online Cloud Server Allocation, IDPDS 2016 (30th IEEE International Parallel and Distibuted Procesing Symposium), Chicago, Illinois, USA, May 23-26, 2016, pp. 323-332. DOI: 10.1109/IPDPS.2016.42 Online URL: http://www.ntu.edu.sg/home/asxytang/papers/ipdps2016.pdf *
487. Galambos Gábor, Versenyképes algoritmusok a diszkrét optimalizálásban, Akadémiai nagydoktori thesis, Szegedi Tudományegyetem, 2016. http://real-d.mtak.hu/931/
488. Lin Chen, Deshi Ye, Guochuan Zhang, An asymptotic competitive scheme for online bin packing, Theoretical Computer Science, 607, 446–454, 2015. DOI:10.1016/j.tcs.2015.04.038 Online: http://www.sciencedirect.com/science/article/pii/S0304397515005150 *
489. Yusen Li, Xueyan Tang, Wentong Cai Dynamic Bin Packing for On-Demand Cloud Resource Allocation, IEEE Transactions on Parallel and Distributed Systems, 27(1):157-170, 2016. IEEE. ISSN: 1045-9219 DOI: 10.1109/TPDS.2015.2393868 http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7014234&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D7014234 *
490. Sebastian Berndt, Klaus Jansen, and Kim-Manuel Klein, Fully Dynamic Bin Packing Revisited, In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Proceedings of APPROX/RANDOM 2015), Naveen Garg and Klaus Jansen and Anup Rao and José D.P. Rolim (Eds.) ISBN 978-3-939897-89-7, LIPICS Vol. 40, pp. 135-151. http://drops.dagstuhl.de/opus/volltexte/2015/5300/pdf/10.pdf (Leibniz International Proceedings in Informatics Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany.) Also: arXiv:1411.0960v1 [cs.DS], 4 Nov 2014. http://arxiv.org/abs/1411.0960 *
491. Nicolaos Matsakis, Approximation Algorithms for Packing and Buffering Problems, PhD Thesis, University of Warwick, 2015. http://wrap.warwick.ac.uk/82141/ *
492. Feifeng Zheng, Li Luo, and E. Zhang, NF-based algorithms for online bin packing with buffer and bounded item size, Journal of Combinatorial Optimization, 30(2):360–369, 2015. DOI 10.1007/s10878-014-9771-8 *
493. Yusen Li, Xueyan Tang, Wentong Cai, On dynamic bin packing for resource allocation in the cloud, SPAA '14 Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 2-11, SPAA’14, June 23–25, 2014, Prague, Czech Republic. ACM New York, NY, USA, 2014. ISBN: 978-1-4503-2821-0 DOI: 10.1145/2612669.2612675 http://dl.acm.org/citation.cfm?id=2612675 *
494. Agni Ásgeirsson, On-line algorithms for bin-covering problems with known item distributions, PhD Thesis -- Georgia Institute of Technology, 2014. Online available: https://smartech.gatech.edu/bitstream/handle/1853/53413/ASGEIRSSON-DISSERTATION-2014.pdf *
495. Kim-Manuel Klein, Robust Bin Packing. In: Ming-Yang Kao (Ed.), Encyclopedia of Algorithms, Springer US, 2014, pp. 1-3. DOI: 10.1007/978-3-642-27848-8_492-1 ISBN: 978-3-642-27848-8 (Online) *
496. Lin Chen, Deshi Ye, Guochuan Zhang, An Asymptotic Competitive Scheme for Online Bin Packing, Lecture Notes in Computer Science, Vol. 8881, pp. 13-24, 2014. Springer International Publishing Switzerland. DOI: 10.1007/978-3-319-12691-3_2 *
497. Andres J. Gonzalez, Bjarne E. Helvik, The positive impact of failures on energy efficient virtual machines consolidation, IEEE International Conference on Communications (ICC), 2014, pp. 4307-4312. 10-14 June 2014, Sydney, Australia, IEEE, 2014. DOI: 10.1109/ICC.2014.6883997 *
498. Sándor P. Fekete, Tom Kamphans, Nils Schweer, Online Square Packing with Gravity, Algorithmica, 68(4), 1019–1044, 2014. DOI: 10.1007/s00453-012-9713-8 *
499. Feifeng Zheng, Li Luo, E. Zhang, NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation, Lecture Notes in Computer Science, Vol. 8287, pp. 25-36, Springer International Publishing Switzerland, 2013. *
500. Klaus Jansen, Kim-Manuel Klein, A Robust AFPTAS for Online Bin Packing with Polynomial Migration, F.V. Fomin et al. (Eds.), ICALP 2013, Lecture Notes in Computer Science, Vol. 7965, pp. 589-600, Springer-Verlag Berlin Heidelberg, 2013. Also: arXiv:1302.4213v1 [cs.DS], 18 Feb 2013, Online available: http://arxiv.org/abs/1302.4213 *
501. Lauri Ahlroth, Online Algorithms in Resource Management and Constraint Satisfaction, PhD Thesis, 130 pages. Aalto University, School of Science, Department of Information and Computer Science. Aalto University publication series DOCTORAL DISSERTATIONS 133/2012, Unigrafia Oy, Helsinki, Finland, 2012. http://urn.fi/URN:ISBN:978-952-60-4825-3 *
502. Lauri Ahlroth, André Schumacher, Pekka Orponen, Online bin packing with delay and holding costs, Operations Research Letters, 41(1), pp. 1–6, 2013. DOI: http://dx.doi.org/10.1016/j.orl.2012.10.006 *
503. Edward G. Coffman, Jr., János Csirik, Gábor Galambos, Silvano Martello, and Daniele Vigo, Bin Packing Approximation Algorithms: Survey and Classification, In: P.M. Pardalos, D.-Z. Du, R.L. Graham, (Eds.), Handbook of Combinatorial Optimization, Springer New York, 2013, pp 455-531. DOI: 10.1007/978-1-4419-7997-1_35
504. Rob van Stee, SIGACT News Online Algorithms Column 20: The Power of Harmony, ACM SIGACT News, 43(2), pp. 127-136, 2012. *
505. Dósa György, Imreh Csanád, Online algoritmusok. Egyetemi tananyag, Typotex, 2011, 80 p. ISBN 978 963 279 508 9 (in Hungarian) *

     [BBG10] J. Balogh, J. Békési, G. Galambos, and G. Reinelt, On a multidimensional semi-on-line bin packing problem In Proceedings of the 8th International Conference on Applied Informatics, Eger, Hungary, January 27–30, 2010, 191–197. ISBN 978-963-9894-72-3.

506. Andreia Soares Correia. Simultaneous Pallet Loading Problem: Picker-to-Parts System, Instituto Superior de Engenharia do Porto, Portugal. Master (MSc-thesis) in Management and Industrial Engineering ID number: 1170880, Advisor: Prof. António José Galrão Ramos, 2024. *
507. Salma Mezghani, Boukthir Haddar, and Habib Chabchoub, The evolution of rectangular bin packing problem — A review of research topics, applications, and cited papers, Journal of Industrial and Management Optimization, 19(5):3329-3361, 2023. DOI: 10.3934/jimo.2022088 URL: https://www.aimsciences.org/article/doi/10.3934/jimo.2022088 *

     [ABBD10] Árgilán, V., J. Balogh, J. Békési, B. Dávid, M. Krész, and A. Tóth, A flexible system for optimizing public transportation, In Proceedings of the 8th International Conference on Applied Informatics, volume 2, pages 181–190, 2010. ISBN 978-963-9894-72-3.

508. Boris Amberg, Ressourceneinsatzplanung im öffentlichen Personennahverkehr: Ähnlichkeitsaspekte in der fahrplanübergreifenden Optimierung, PhD Dissertation, Universitat Paderborn, 2014. http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1384943 *
509. Balázs Dávid, Application-oriented scheduling problems in public bus transportation, PhD Thesis, University of Szeged, Szeged, 2018. URL: http://doktori.bibl.u-szeged.hu/9745

     [BBGM09] Balogh, J., J. Békési, G. Galambos, and M.C. Markót, Improved lower bounds for semi-online bin packing problems, Computing, 84(2009), 139-148.

510. Konstantina Mellou, Marco Molinaro, and Rudy Zhou, The Power of Migrations in Dynamic Bin Packing, Proceedings of the ACM on Measurement and Analysis of Computing Systems, Volume 8, Issue 3, Article No.: 45, Pages 1-28, 2024. DOI: https://doi.org/10.1145/3700435 *
511. Konstantina Mellou, Marco Molinaro, and Rudy Zhou, The Power of Migrations in Dynamic Bin Packing, arXiv:2408.13178 [cs.DS], 23 Aug 2024. DOI: https://doi.org/10.48550/arXiv.2408.13178 *
512. János Csirik and György Dósa, Performance Guarantees for One Dimensional Bin Packing, In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Methodologies and Traditional Applications (Teofilo F. Gonzalez, Ed.), Chapter 28, CRC Press, 2018. URL: https://www.routledgehandbooks.com/doi/10.1201/9781351236423-28 *
513. Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, and Asaf Levin, Batch Coloring of Graphs, Algorithmica, 80(11):3293–3315, 2018. DOI: 10.1007/s00453-017-0386-1 Also in arXiv:1610.02997 [cs.DS], 10 Oct 2016. https://arxiv.org/abs/1610.02997 *
514. Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, and David Wajc, Fully-Dynamic Bin Packing with Little Repacking, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella (Eds.), LIPIcs (Leibniz International Proceedings in Informatics Schloss Dagstuhl), Vol. 107, pp. 51:1–51:24, 2018. Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany. Also: Björn Feldkord, Matthias Feldotto, and Sören Riechers, A Tight Approximation for Fully Dynamic Bin Packing without Bundling, arXiv:1711.01231 [cs.DS], 3 Nov 2017. https://arxiv.org/abs/1711.01231 *
515. Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, and Asaf Levin, Batch Coloring of Graphs, In: Approximation and Online Algorithms 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers, Lecture Notes in Computer Science, 10138, 52-64. DOI: 10.1007/978-3-319-51741-4_5 http://link.springer.com/chapter/10.1007/978-3-319-51741-4_5 *
516. Hermann Schichl and Waltraud Stollinger, Collection of literature references and abstracts for Optimal Packing, Optimization, and Modeling of Concrete and other Disperse Systems, October 29, 2013. Online available: http://www.mat.univie.ac.at/~herman/papers/concreterefs.pdf *
517. Edward G. Coffman, Jr., János Csirik, Gábor Galambos, Silvano Martello, and Daniele Vigo, Bin Packing Approximation Algorithms: Survey and Classification, In: P.M. Pardalos, D.-Z. Du, R.L. Graham, (Eds.), Handbook of Combinatorial Optimization, Springer New York, 2013, pp 455-531. DOI: 10.1007/978-1-4419-7997-1_35

     [BBG09] Balogh, J., J. Békési, G. Galambos, and M. Krész, Model and Algorithm for a Vehicle Scheduling Problem with Refueling, Proceedings of the 9th Workshop on Models and Algorithms for Planning and Scheduling Problems, Abbey Rolduc, The Netherlands, June 29 - July 3, 2009, pp. 229-231.

518. Albert Nagy and József Tick, Modeling of bus transport operative planning tasks, 2020 IEEE 18th World Symposium on Applied Machine Intelligence and Informatics (SAMI), Herlany, Slovakia, 2020, pp. 000089-000094. DOI: 10.1109/SAMI48414.2020.9108738. https://ieeexplore.ieee.org/document/9108738/ *
519. Dávid Balázs, Békési József és Krész Miklós, Járművek ütemezése jármű-specifikus feladatok figyelembevételével, XXX. Magyar Operációkutatási Konferencia, Előadáskivonatok, Balatonőszöd, 2013. június 10-13., 81-82.
520. Jozsef Bekesi, Balazs David, Miklos Kresz, Vehicle Scheduling with Respect to Vehicle-Specific Tasks, 10th International Conference on Computational Management, HEC Montréal, Canada, May 1-3, 2013.
521. Balázs Dávid, Heuristics for the multiple depot vehicle scheduling problem, Proceedings of the 2010 Mini-Conference on Applied Theoretical Computer Science, Koper, Slovenia, 13-14 October, 2010, University of Primorska Press, 2011, pp. 23-28. (ISBN: 978-961-6832-10-6) *
522. József Békési, Andrej Brodnik, Miklós Krész, David Pash, An Integrated Framework for Bus Logistics Management: Case Studies, In: Stefan Voß, Julia Pahl, Silvia Schwarze (eds.), Logistik Management: Systeme, Methoden, Integration, Springer-Verlag Berlin Heidelberg, 2009.

     [BBGR08] Balogh, J., J. Békési, G. Galambos, and G. Reinelt, Lower bound for the online bin packing problem with restricted repacking, SIAM Journal on Computing, 38(2008), 398-410.

523. Konstantina Mellou, Marco Molinaro, and Rudy Zhou, The Power of Migrations in Dynamic Bin Packing, Proceedings of the ACM on Measurement and Analysis of Computing Systems, Volume 8, Issue 3, Article No.: 45, Pages 1-28, 2024. DOI: https://doi.org/10.1145/3700435 *
524. Rahul Vaze, Online Algorithms, Cambridge University Press, 2023. Online ISBN: 9781009349178 DOI: https://doi.org/10.1017/9781009349178 *
525. Konstantina Mellou, Marco Molinaro, and Rudy Zhou, The Power of Migrations in Dynamic Bin Packing, arXiv:2408.13178 [cs.DS], 23 Aug 2024. DOI: https://doi.org/10.48550/arXiv.2408.13178 *
526. Agostino Mascitti, Tommaso Cucinotta, and Luca Abeni, Combining admission tests for heuristic partitioning of real-time tasks on ARM big.LITTLE multi-processor architecture, Journal of Systems Architecture 119, paper 102229, 2021. DOI: https://doi.org/10.1016/j.sysarc.2021.102229 *
527. Bastian Rieck, Basic Analysis of Bin-Packing Heuristics, arXiv:2104.12235 [math.OC], 25 Apr 2021. https://arxiv.org/abs/2104.12235 *
528. Bakhthemmat, A. and Izadi, M., Solving fully dynamic bin packing problem for virtual machine allocation in the cloud environment by the futuristic greedy algorithm, Journal of Intelligent and Fuzzy Systems, 40(3):4737-4760, 2021. DOI: 10.3233/JIFS-201581 *
529. A. Mascitti, T. Cucinotta, and L. Abeni, Heuristic partitioning of real-time tasks on multi-processors, in Proceedings of the 2020 IEEE 23rd International Symposium on Real-Time Distributed Computing (ISORC), Nashville, Tennessee, USA, 2020 May 19-21, pp. 36-42. DOI: 10.1109/ISORC49007.2020.00015. https://retis.sssup.it/~tommaso/publications/IEEE-ISORC-2020-HEUR.pdf (Ref. to the arXiv-version.) *
530. Sebastian Berndt, Klaus Jansen, and Kim-Manuel Klein, Fully dynamic bin packing revisited, Mathematical Programming, 179(1–2):109–155, 2020. DOI: https://doi.org/10.1007/s10107-018-1325-x, Springer Berlin Heidelberg. *
531. Jansen, K. and Klein, K.-M., A robust AFPTAS for online bin packing with polynomial migration, SIAM Journal on Discrete Mathematics, 33(4):2062-2091, 2019. DOI: 10.1137/17M1122529 *
532. Guru Guruganesh. Topics in Approximation and Online Algorithms, PhD Thesis, CMU-CS-18-121, August 26, 2018. School of Computer Science, Carnegie Mellon University, Pittsburgh, PA. URL: http://reports-archive.adm.cs.cmu.edu/anon/2018/CMU-CS-18-121.pdf *
533. János Csirik and György Dósa, Performance Guarantees for One Dimensional Bin Packing, In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Methodologies and Traditional Applications (Teofilo F. Gonzalez, Ed.), Chapter 28, CRC Press, 2018. URL: https://www.routledgehandbooks.com/doi/10.1201/9781351236423-28 *
534. David Wajc, Thesis Proposal: Matching Algorithms Under Uncertainty, and Matching Lower Bounds, PhD Thesis Proposal, Carnegie Mellon University, Pittsburgh, 2018. http://halley.exp.sis.pitt.edu/comet/presentColloquium.do?col_id=13465 *
535. Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, and David Wajc, Fully-Dynamic Bin Packing with Little Repacking, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella (Eds.), LIPIcs (Leibniz International Proceedings in Informatics Schloss Dagstuhl), Vol. 107, pp. 51:1–51:24, 2018. Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany. Also: Anupam Gupta, Guru Guruganesh, Amit Kumar, and David Wajc, Fully-Dynamic Bin Packing with Limited Repacking, arXiv:1711.02078 [cs.DS], 6 Nov 2017. https://arxiv.org/abs/1711.02078 And also: Björn Feldkord, Matthias Feldotto, and Sören Riechers, A Tight Approximation for Fully Dynamic Bin Packing without Bundling, arXiv:1711.01231 [cs.DS], 3 Nov 2017. https://arxiv.org/abs/1711.01231 *
536. Seunghwan Yoo and Sungchun Kim, Cost-based Competitive Analysis for Cloud Platform Service Using Online Dynamic Bin Packing, International Journal of Advanced Research in Computer Science & Technology (IJARCST 2017), 5(4):37-44, 2017. *
537. Kim-Manuel Klein, About the Structure and Sensitivity of Integer Linear Programs and their Application in Combinatorial Optimization, PhD Thesis (Dissertation Dr.-Ing.), Technischen Fakultat, Christian-Albrechts-Universitat zu Kiel, Kiel, Germany, 2017. 2017.04.19., URL: http://macau.uni-kiel.de/receive/dissertation_diss_00021166?lang=en *
538. Carsten Trinitis, Josef Weidendorfer, and André Brinkmann, Co-Scheduling: Prospects and Challenges, In: Co-Scheduling of HPC Applications, C. Trinitis, J. Weidendorfer (Eds.), Volume 28 of Advances in Parallel Computing, pp. 1-11, 2017. IOS Press. ISBN print: 978-1-61499-729-0 ISBN online: 978-1-61499-730-6 DOI: 10.3233/978-1-61499-730-6-1 *
539. Galambos Gábor, Versenyképes algoritmusok a diszkrét optimalizálásban, Akadémiai nagydoktori thesis, Szegedi Tudományegyetem, 2016. http://real-d.mtak.hu/931/
540. Sebastian Berndt, Klaus Jansen, and Kim-Manuel Klein, Fully Dynamic Bin Packing Revisited, In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Proceedings of APPROX/RANDOM 2015), Naveen Garg and Klaus Jansen and Anup Rao and José D.P. Rolim (Eds.) ISBN 978-3-939897-89-7, LIPICS Vol. 40, pp. 135-151. http://drops.dagstuhl.de/opus/volltexte/2015/5300/pdf/10.pdf (Leibniz International Proceedings in Informatics Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany.) * Also: arXiv:1411.0960v1 [cs.DS], 4 Nov 2014. http://arxiv.org/abs/1411.0960 *
541. Zoltán Ádám Mann, Approximability of virtual machine allocation: much harder than bin packing (invited paper), Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, June 2-5, 2015, Fukuoka, Japan, pp. 21-30, 2015. Online available: http://www.cs.bme.hu/~mann/publications/Japan-2015/Mann_Japan_2015.pdf *
542. Benkő Attila, Ládapakolási és ütemezési feladatok elméleti, és számítógéppel segített vizsgálata, Doktori (PhD) értekezés, Pannon Egyetem, Matematika Tanszék, Informatikai Tudományok Doktori Iskola, 2014. http://konyvtar.uni-pannon.hu/doktori/2014/Benko_Attila_dissertation.pdf *
543. Epstein, L. and Levin, A., Robust Approximation Schemes for Cube Packing, SIAM Journal on Optimization, 23(2), pp. 1310-1343, 2013. (DOI: 10.1137/11082782X) *
544. Prudence W.H. Wong, Fencol C.C. Yung, and Mihai Burcea, An 8/3 Lower Bound for Online Dynamic Bin Packing, In: K.-M. Chao, T.-s. Hsu, and D.-T. Lee (Eds.): ISAAC 2012, LNCS 7676, pp. 44–53, Springer-Verlag Berlin Heidelberg 2012. *
545. György Dósa and Zsolt Tuza, Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms, 2012. http://arxiv.org/pdf/1207.5672.pdf *
546. Rob van Stee, SIGACT News Online Algorithms Column 20: The Power of Harmony, ACM SIGACT News, 43(2), pp. 127-136, 2012. *
547. Laura Cruz Reyes, Claudia Gómez Santillán, Marcela Quiroz, Adriana Alvim, Patricia Melin, Jorge Ruiz Vanoye, and Vanesa Landero Najera, "Heuristic Algorithms: An Application to the Truck Loading Problem", In Logistics Management and Optimization through Hybrid Artificial Intelligence Systems, eds. Carlos Alberto Ochoa Ortiz Zezzatti, Camelia Chira, Arturo Hernandez Aguirre, and Miguel Basurto, Chapter 9, pp. 238-267, IGI Global, 2012. DOI: 10.4018/978-1-4666-0297-7.ch009 *
548. Xin Han, Chao Peng, Deshi Ye, Dahai Zhang, and Yan Lan, Dynamic bin packing with unit fraction items revisited, Information Processing Letters, 110(2010), 1049-1054. *

     [BCS07] Balogh, J., R.J.B. Craven, and R.P. Stateva, The Area Method for Phase Stability Analysis Revisited: Further Developments. Formulation in Terms of the Convex Envelope of Thermodynamic Surfaces, Industrial & Engineering Chemistry Research, 46(2007), 1611-1631.

549. Jani Kangas, Ilkka Malinen, and Juha Tanskanen, Modified Bounded Homotopies in the Solving of Phase Stability Problems for Liquid-Liquid Phase Split Calculations, Ind. Eng. Chem. Res., 50(11), pp. 7003-7018, 2011. *
550. Nima Saber, Phase Behaviour Prediction for Ill-Defined Hydrocarbon Mixtures, PhD Thesis, Department of Chemical and Materials Engineering, University of Alberta, Edmonton, Canada, 2011. *
551. A. Marcilla, M.M. Olaya, M.D. Serrano, and J. A. Reyes-Labarta, Aspects To Be Considered for the Development of a Correlation Algorithm for Condensed Phase Equilibrium Data of Ternary Systems, Ind. Eng. Chem. Res., 49(20), pp. 10100-10110, 2010. *
552. N. Saber, J.M. Shaw, Rapid and robust phase behaviour stability analysis using global optimization, Fluid Phase Equilibria, 264(1-2), pp. 137-146, 2008. *

     [BT05] Balogh, J. and B. Tóth, Global optimization on Stiefel manifolds: a computational approach, Central European Journal of Operations Research, 13(2005), 213-232.

553. Mengzhu Wang, Xiang Zhang, Long Lan, Wei Wang, Huibin Tan, and Zhigang Luo, Improving Unsupervised Domain Adaptation by Reducing Bi-level Feature Redundancy arXiv:2012.15732 [cs.LG], 2020. https://arxiv.org/abs/2012.15732 *
554. Balázs L. and Balázs Bánhelyi, An optimization technique for verified location of trajectories with prescribed geometrical behaviour in the chaotic forced damped pendulum, Central European Journal of Operations Research, 21(4), 757-767, 2013. DOI: 10.1007/s10100-012-0256-5 *
555. János Fülöp, A D.C. Programming Approach for Optimization with Orthonormality Constraints. In: C.Q.Ma, L.A.Yu, D.B.Zhang and Z.B.Zhou (eds.), Global Optimization: Theory, Methods & Applications I, Lecture Notes in Decision Science, Vol. 12, 2009, pp. 930-935. *
556. Chandra Sekhar Pedamallu, Linet Özdamar, Tibor Csendes, and Tamás Vinkó, Efficient interval partitioning for constrained global optimization, Journal of Global Optimization, 42(2008), 369-384. *
557. Chandra Sekhar Pedamallu, New Interval Partitioning Algorithms For Global Optimization Problems, Ph.D. thesis, School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore, 2007. *

     [BG05] Balogh, J., G. Galambos, Algorithms for the on-line bin packing problem with repacking, Alkalmazott Matematikai Lapok, 24, 117–130, 2007. (in Hungarian)

558. Sara Ali, António Galrão Ramos, Maria Antónia Carravilla, and José Fernando Oliveira, Heuristics for online three-dimensional packing problems and algorithm selection framework for semi-online with full look-ahead, Applied Soft Computing, 151, 111168, 2024. DOI: https://doi.org/10.1016/j.asoc.2023.111168 *
559. Feifeng Zheng, Li Luo, and E. Zhang, NF-based algorithms for online bin packing with buffer and bounded item size, Journal of Combinatorial Optimization, 30(2):360–369, 2015. DOI 10.1007/s10878-014-9771-8 *
560. Feifeng Zheng, Li Luo, E. Zhang, NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation, Lecture Notes in Computer Science, Vol. 8287, pp. 25-36, Springer International Publishing Switzerland, 2013. *

     [BBGR05] Balogh, J., J. Békési, G. Galambos, and G. Reinelt, Lower Bound for The On-line Packing Problem with Restricted Repacking, in: 29th Hungarian Conference of Mathematics, Physics and Computer Science (2005).

561. Laura Cruz Reyes, Diana M. Nieto-Yá.ez, Nelson Rangel-Valdez, Juan A. Herrera Ortiz, J. González B., Guadalupe Castilla Valdez, and J. Francisco Delgado-Orta, DiPro: An Algorithm for the Packing in Product Transportation Problems with Multiple Loading and Routing Variants, Lecture Notes in Computer Science, Volume 4827 LNAI, 2007, pp. 1078-1088. *

     [BCR04] Balogh, J., T. Csendes, and T. Rapcsák, Some global optimization problems on Stiefel manifolds, Journal of Global Optimization 30(2004), 91-101.

562. Ren-Cang Li, A Theory of the NEPv Approach for Optimization on the Stiefel Manifold, Foundations of Computational Mathematics, in press, 2024+. DOI: https://doi.org/10.1007/s10208-024-09687-2 Also in: arXiv:2305.00091 [math.OC], 28 Apr 2023. https://doi.org/10.48550/arXiv.2305.00091 *
563. Halyna Bila, Oleksandr Korchynskyy, Petro Stetsyuk, Olha Khomiak, and Serhiy Shekhovtsov, Using the NEOS Server for Solving Two Classes of Optimization Problems, Cybernetics and Computer Technologies. 2022. 4. P. 56–81. (in Ukrainian) 4:56-81, 2022. DOI: https://doi.org/10.34229/2707-451X.22.4.5 *
564. Fei Ding, Shiyuan He, David E. Jones, and Jianhua Z. Huang, Functional PCA With Covariate-Dependent Mean and Covariance Structure Technometrics, 64(3):335-345, 2022. https://doi.org/10.1080/00401706.2021.2008502 * Also in: Supervised Functional PCA with Covariate Dependent Mean and Covariance Structure, arXiv:2001.11425v1 [stat.ME], 30 Jan 2020, https://arxiv.org/pdf/2001.11425.pdf *
565. Li Wang, Lei-Hong Zhang, and Ren-Cang Li, Maximizing sum of coupled traces with applications, Numerische Mathematik, 152, 587–629, 2022. DOI: https://doi.org/10.1007/s00211-022-01322-y *
566. Abigél Mester, Dániel Zombori, László Pál, and Balázs Bánhelyi, Efficiency Improvement of the GLOBAL Optimization Method by Local Search Changes, Acta Polytechnica Hungarica, 19(2):29-42. 2022. DOI: 10.12700/APH.19.2.2022.2.2 *
567. Edgar Fuentes Figueroa and Oscar Dalmau, Transportless conjugate gradient for optimization on Stiefel manifold, Computational and Applied Mathematics, 39, Article number: 151, 2020. DOI: https://doi.org/10.1007/s40314-020-01184-w *
568. B. Bánhelyi, T. Csendes, B. Lévai, L. Pál, and D. Zombori, The GLOBAL optimization algorithm. Newly Updated with Java Implementation and Parallelization, SpringerBriefs on Optimization, Springer International Publishing AG, 2018. DOI: 10.1007/978-3-030-02375-1 URL: https://www.springer.com/la/book/9783030023744
569. Edgar Fuentes Figueroa, Tesis, Maestro en Ciencias (MSc Thesis), Tansportless conjugate gradient for optimization on Stiefel Manifolds, (Director de Tesis: Dr. Oscar Susano Dalmau Cedeño), Guanajuato, Gto., 19 de Diciembre de 2018, Brasil. *
570. Petre Birtea, Ioan Caşu, and Dan Comănescu, First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds. Optimization Letters 13, 1773–1791, 2019. https://doi.org/10.1007/s11590-018-1319-x (Also: arXiv preprint arXiv:1709.06295 [math.OC], 2017. https://arxiv.org/abs/1709.06295v1) *
571. Xiaojing Zhu, A Riemannian conjugate gradient method for optimization on the Stiefel manifold, Computational Optimization and Applications, 67(1), 73–110, 2017. DOI: 10.1007/s10589-016-9883-4 URL: https://link.springer.com/article/10.1007/s10589-016-9883-4 *
572. Bo Jiang, Yu-Hong Dai, A framework of constraint preserving update schemes for optimization on Stiefel manifold, Mathematical Programming, 153(2), 535–575, 2015. DOI: 10.1007/s10107-014-0816-7 (Also: arXiv:1301.0172v1 [math.OC] 2 Jan 2013.) *
573. Vijey Thayananthan, Ahmed Alzahrani, and Iyad Katib, Systems Engineering: Optimization on Stiefel Manifold for MIMO System, The International Journal of Soft Computing and Software Engineering, 3(3), 564-569, 2013. DOI: 10.7321/jscse.v3.n3.85 *
574. Jin-Hua Wang, Jen-Chih Yao, Chong Li, Gauss-Newton method for convex composite optimizations on Riemannian manifolds, Journal of Global Optimization, 53(1), 5-28, 2012. DOI 10.1007/s10898-010-9638-1 *
575. Juan José Fernández-Durán and María Mercedes Gregorio-Domínguez, Maximum likelihood estimation of nonnegative trigonometric sum models using a Newton-like algorithm on manifolds, Electron. J. Statist., 4(2010), 1402-1410. *
576. László Pál, Global optimization algorithms for bound constrained problems, PhD Thesis, University of Szeged, PhD School in Computer Science, Szeged, 2010. *
577. János Fülöp, A D.C. Programming Approach for Optimization with Orthonormality Constraints. In: C.Q.Ma, L.A.Yu, D.B.Zhang and Z.B.Zhou (eds.), Global Optimization: Theory, Methods & Applications I, Lecture Notes in Decision Science, Vol. 12, 2009, pp. 930-935. *
578. Fülöp János, Globális optimalizálás ortonormalitási feltételek mellett, XXVIII. Magyar Operációkutatási Konferencia, Előadáskivonatok, Balatonőszöd, 2009. június 8-10, p. 53. *
579. Tibor Csendes, László Pál, J. Oscar H. Sendín, Julio R. Banga: The GLOBAL Optimization Method Revisited. Optimization Letters 2(2008), 445-454.
580. L. Pál and T. Csendes: Improvements on the GLOBAL Optimization Algorithm with Numerical Tests, Proc. ICAI, Eger, Hungary, Vol. 2, 2007, 101-109.
581. Viklands, T., Algorithms for Weighted Orthogonal Procrustes Problem and other Least Squares Problems, Ph.D. Thesis, UMINF-06.10, Department of Computing Science, Umea University, Umea, Sweden, 2006. *
582. Roberto Cristóvão Mesquita Silva, Trajetória Central em Programação Semidenida, Método do Ponto Proximal Generalizado e Trajetória de Cauchy em Variedade Riemanniana, Thesis presented to COPPE/UFRJ as a partial fulllment of the requirements for the degree of Doctor of Science (D.Sc.), Rio de Janeiro, Brasil, 2006. Online URL: https://pdfs.semanticscholar.org/f34b/f488968603d1c43043c933b289bfe1203274.pdf *
583. Viklands, T., On the Number of Minima to Weighted Orthogonal Procrustes Problems, Technical Report UMINF-06.08, Department of Computing Science, Umea University, Umea, Sweden, 2006. Online available: http://www.cs.umu.se/~viklands/ *
584. J. X. da Cruz Neto, O. P. Ferreira, P. R. Oliveira, and R. C. M. Silva, Central Paths in Semidefinite Programming, Generalized Proximal Point Method and Cauchy Trajectories in Riemannian Manifolds, XXXVIII Simpósio Brasileiro de Pesquisa Operacional, Pesquisa Operacional na Sociedade: Educação, Meio Ambiente e Desenvolvimento, 12-15/09/06, Goiânia, Brasil, 2006. Online available: http://www.din.uem.br/sbpo/sbpo2006/pdf/arq0097.pdf and also in Optimization Online 1327, 2006. *
585. Csendes T., Markót M.Cs., Szabó P.G., Tóth B., Vinkó T.: Global Optimization And Circle Packing, In: Scientific Research at the Institute of Informatics of the University of Szeged, pp. 11-16, 2000-2003.

     [BCS03] Balogh, J., T. Csendes, and R.P. Stateva, Application of a stochastic method to the solution of the phase stability problem: Cubic equations of state, Fluid Phase Equilibria, 212(1-2), pp. 257-267 (2003).

586. M.S. Rego, J.I.C. Rego, L.N.H.G. Oliveira, M.S. Sa, Inicializacao Global Topografica Aplicada Analise de Estabilidade de Fases, Trends in Computational and Applied Mathematics, 26(2025), e01788 Sociedade Brasileira de Matematica Aplicada e Computacional, Online version ISSN 2676-0029, DOI: 10.5540/tcam.2025.026.e01788 *
587. Bamikole John and Narasigadu Caleb, Phase Stability Analysis and Phase Equilibrium Calculations in Reactive and Nonreactive Systems Using New Hybrids of Pelican and Gorilla Troops Algorithms Chemical Engineering Research and Design, 194, 163-178, 2023. DOI: https://doi.org/10.1016/j.cherd.2023.04.042 *
588. John Olumide Bamikole and Caleb Narasigadu, Application of Pathfinder, Honey Badger, Red Fox and Horse Herd algorithms to phase equilibria and stability problems, Fluid Phase Equilibria, 566, 113682, 2023. DOI: https://doi.org/10.1016/j.fluid.2022.113682 * Also: Available at SSRN, 2022. DOI: http://dx.doi.org/10.2139/ssrn.4241194 *
589. Mária Csete, András Szenes, Emese Tóth, Dávid Vass, Olivér Fekete, Balázs Bánhelyi, István Papp, Tamás Bíró, László P. Csernai, and Norbert Kroó, Comparative Study on the Uniform Energy Deposition Achievable via Optimized Plasmonic Nanoresonator Distributions, Plasmonics, 17, pp. 775–787, 2022 DOI: https://doi.org/10.1007/s11468-021-01571-x *
590. Abigél Mester, Dániel Zombori, László Pál, and Balázs Bánhelyi, Efficiency Improvement of the GLOBAL Optimization Method by Local Search Changes, Acta Polytechnica Hungarica, 19(2):29-42. 2022. DOI: 10.12700/APH.19.2.2022.2.2 *
591. R.M. Fonseca-Pérez, A. Bonilla-Petriciolet∗, J.C. Tapia-Picazo, and J.E. Jaime-Leal, A reconsideration on the resolution of phase stability analysis using stochastic global optimization methods: Proposal of a reliable set of benchmark problems, Fluid Phase Equilibria, 548, 113180, 2021. DOI: https://doi.org/10.1016/j.fluid.2021.113180 *
592. Lévai Balázs L., Design and Development of Global Optimization Methods with Applications, PhD Thesis, University of Szeged, 2019. URL: https://doktori.bibl.u-szeged.hu/10266 *
593. Rego, Marroni de Sá, Topographical global initialization applied to thermodynamicproblems of phase equilibrium, 2019. 192 pages. Tese (Doutorado em Modelagem Computacional) - Instituto Politécnico, Universidade do Estado do Rio de Janeiro, NovaFriburgo, 2019. (in Portuguese) http://152.92.4.120:8080/handle/1/13627 http://152.92.4.120:8080/bitstream/1/13627/1/Tese_MarroniDeSaRego.pdf *
594. B. Bánhelyi, T. Csendes, B. Lévai, L. Pál, and D. Zombori, The GLOBAL optimization algorithm. Newly Updated with Java Implementation and Parallelization, SpringerBriefs on Optimization, Springer International Publishing AG, 2018. DOI: 10.1007/978-3-030-02375-1 URL: https://www.springer.com/la/book/9783030023744
595. M. Srinivas and G.P. Rangaiah, Differential evolution with tabu list for global optimization: evaluation of two versions on benchmark and phase stability problems, In: Gade Pandu Rangaiah, Shivom Sharma (eds.): Differential Evolution in Chemical Engineering: Developments and Applications. World Scientific, 2017, Chapter 4, pp. 91-127. ISBN-13: 978-9813207516 *
596. Reinaldo Calderón Supelano, Equlíbrio de fases e estabilidade termodinámica en flashes multifásicos, MSc Thesis, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brasil, 2017. URL: http://portal.peq.coppe.ufrj.br/index.php/producao-academica/dissertacoes-de-mestrado/2017/476--52/file *
597. Kuveneshan Moodley, A Universal Segment Approach for the Prediction of the Activity Coefficient, PhD Thesis, School of Engineering, Discipline of Chemical Engineering, University of KwaZulu-Natal, Republic of South Africa, 2016. Supervisors: Prof. D. Ramjugernath and Prof. J. Rarey. URL: https://researchspace.ukzn.ac.za/xmlui/handle/10413/14567 *
598. Sourabh Ahitan, Phase Behavior Modeling of Asymmetric n-Alkane + Aromatic and Naphthenic Hydrocarbon Mixtures, MSc Thesis, Department of Chemical and Materials Engineering, University of Alberta, Alberta, Canada, 2016. Online URL: http://www.jmshaw.ualberta.ca/en/Publications/~/media/jmshaw/Thesis/Thesis%202016/Ahitan_Sourabh_201603_MSc.pdf *
599. Costa, Janaína Imbiriba da., Topographical global optimization for solution of nonlinearsystems of equations with constraints and applications to the phase stability of thermody-namic mixtures, 2016. 95 pages. Dissertação (Mestrado em Modelagem Computational) - Instituto Politécnico, Universidade do Estado do Rio de Janeiro, Nova Friburgo, 2016. (in Portuguese) http://152.92.4.120:8080/handle/1/13830 http://152.92.4.120:8080/bitstream/1/13830/1/Dissertacao_JanainaImbiribaDaCosta.pdf *
600. Fei, Weiyang (Yang Fei), New Progress in research and application of extraction columns, Journal of Chemical Technology, 1, 44-51, 2013. *
601. Sourabh Ahitan, Marco A. Satyro, and John M. Shaw, Systematic Misprediction of n-Alkane + Aromatic and Naphthenic Hydrocarbon Phase Behavior Using Common Equations of State, J. Chem. Eng. Data, 60(11), pp. 3300–3318, 2015. DOI: 10.1021/acs.jced.5b00539 *
602. Mike Preuss, Simon Wessing, Günter Rudolph, Gabriele Sadowski, Solving Phase Equilibrium Problems by Means of Avoidance-Based Multiobjectivization, In: Springer Handbook of Computational Intelligence (Janusz Kacprzyk, Witold Pedrycz, Eds.), 2015, pp. 1159-1171. (Chapter 58.) Springer Berlin Heidelberg. ISBN: 978-3-662-43504-5 (Print) 978-3-662-43505-2 (Online) DOI 10.1007/978-3-662-43505-2 Online available: http://link.springer.com/chapter/10.1007/978-3-662-43505-2_58 *
603. Nélio Henderson, Marroni de Sá Rêgo, Wagner F. Sacco, Raimundo A. Rodrigues Jr., A new look at the topographical global optimization method and its application to the phase stability analysis of mixtures, Chemical Engineering Science, 127, 151-174, 2015. DOI: http://dx.doi.org/10.1016/j.ces.2015.01.029 *
604. Kuveneshan Moodley, Jürgen Rarey, Deresh Ramjugernath, Application of the bio-inspired Krill Herd optimization technique to phase equilibrium calculations, Computers & Chemical Engineering, 74, 75-88, 2015. ISSN 0098-1354, DOI: 10.1016/j.compchemeng.2014.12.008 *
605. Yao Teng, Simulation and Research on the Production of Methylethylketoximino silane (MOS), MSc Thesis, East University of Chemical Engineering, China, 2015. http://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CMFD&QueryID=7&CurRec=1&dbname=CMFDTEMP&filename=1015559309.nh *
606. Jani Kangas, Separation process modelling. Highlighting the predictive capabilities of the models and the robustness of the solving strategies, Acta Universitatis Ouluensis, C Technica 482, 2014. University of Oulu, Oulu, Finland. ISBN 978-952-62-0375-1 *
607. Nélio Henderson, Joviana Sartori, and Wagner F. Sacco, Phase Stability Analysis using a Polarization Technique and the Randomness of a Stochastic Method in an Unconstrained Optimization Framework, Ind. Eng. Chem. Res., 53(8), 3342–3352, 2014. DOI: 10.1021/ie402819r *
608. Boyan B. Ivanov, Anatolii A. Galushko, and Roumiana P. Stateva, Phase Stability Analysis with Equations of State — A Fresh Look from a Different Perspective, Industrial & Engineering Chemistry Research, 52(32), pp. 11208–11223, 2013. DOI: 10.1021/ie401072x
609. Bhargava, V., Fateen, S.E.K., Bonilla-Petriciolet, A., Cuckoo Search: A new nature-inspired optimization method for phase equilibrium calculations, Fluid Phase Equilibria, 337, 191-200, 2013. *
610. José Matías Garrido Acuña, Automatización y generalización del cómputo del equilibrio de fases en sistemas multicomponente de topología compleja mediante técnicas de estabilidad y optimización global, Tesis Magíster, Universidad de Concepción, Concepción, Chile, 2012. (in Spanish) *
611. Khaled Boudjlida, Méthodes d’optimisation numérique pour le calcul de stabilité thermodynamique des phases, THÈSE, Université de Pau et des Pays de l'Adour, Ecole Doctorale des Sciences Exactes et leurs Applications (Ph.D. Thesis, University of Pau and Pays de l'Adour), 2012. (in French) *
612. Samborskaja, M.A., Mitjanina, O.E., Djorina, K.V., Stacionarnije sostojanija v kolonnah reakcionnoj rektifikaciji, Vestnik MITHT, Teoreticheskije Osnovi Himicheskoj Tehnologiji, 7(5), 48-51, 2012. (in Russian) *
613. Ilkka Malinen, Jani Kangas, Juha Tanskanen, A new Newton homotopy based method for the robust determination of all the stationary points of the tangent plane distance function, Chemical Engineering Science, 84, 266-275, 2012. *
614. Haibo Zhang, New Strategies for Global Optimization of Chemical Engineering Applications by Differential Evolution, Ph.D. Thesis, Department of Chemical and Biomolecular Engineering, National University of Singapore, Singapore, 2012. *
615. Li Wentao, Study on Liquid-Liquid Equilibrium and Engineering Application, MSc Thesis, East China University of Science and Technology, Dept. Chemical Engineering, China, 2012. *
616. Joviana Sartori de Souza, Luiz Nélio Henderson Guedes de Oliveira, Contribuições de hibridzação de uma metaheurística partículas com um método de busca direta, Congreso Latino-Iberoamericano de Investigación Operativa, Simpósio Brasileiro de Pesquisa Operacional, 24-28/09, Rio de Janiero, Brasil, 2012. (in Portugal) *
617. S. Sashidhar, GautamMoni Patro, Venkata R Basam, P. Mallikarjuna Rao, Pre-Optimization of Brushless PM Motor Design using Interval Arithmetic, International Journal of Engineering Research and Applications, 1(4), pp. 1250-1255, 2011. *
618. Nélio Henderson, Nelza E. Barufattia, Wagner F. Saccob, The Least Dot Products method: A new numerical paradigm for phase stability analysis of thermodynamic mixtures, Chemical Engineering Science, 66(22), pp. 5684-5702, 2011. *
619. Jani Kangas, Ilkka Malinen, and Juha Tanskanen, Modified Bounded Homotopies in the Solving of Phase Stability Problems for Liquid-Liquid Phase Split Calculations, Ind. Eng. Chem. Res., 50(11), pp. 7003-7018, 2011. *
620. Adrián Bonilla-Petriciolet, Didilia I. Mendoza-Castillo, Juan Gabriel Segovia-Hernández and Juan Carlos Tapia-Picazo, "Phase equilibrium modeling in non-reactive systems using Harmony Search", in: Stochastic Optimization - Seeing the Optimal for the Uncertain, Ioannis Dritsas (Ed.), InTech, Croatia, 2011, pp. 457-476. (Chapter 19.) ISBN: 978-953-307-829-8 Online available at: http://www.intechopen.com/articles/show/title/phase-equilibrium-modeling-in-non-reactive-systems-using-harmony-search *
621. H. Zhang, A. Bonilla-Petriciolet and G.P. Rangaiah, A Review on Global Optimization Methods for Phase Equilibrium Modeling and Calculations, The Open Thermodynamics Journal, 5 (Suppl 1-M7), 71-92, 2011. *
622. L. Pál and T. Csendes, Egy intervallum alapú globális optimalizálási módszer és alkalmazása szenzor lokalizálási feladatra, Alkalmazott Matematikai Lapok, 28(2011), 17-39.
623. Nima Saber, Phase Behaviour Prediction for Ill-Defined Hydrocarbon Mixtures, PhD Thesis, University of Alberta, Edmonton, Alberta, Canada, 2011. *
624. O.E. Mitjanina, Optimizacija processa sinteza visokooktanovih dobavok v kolonnah reakcionnoj rektifikaciji (in Russian). CSc dissertation, Tomsk, Russia, 2011. *
625. S.B. Rodriguez-Reartes, Equilibrio entre fases sólidas y fluidas en mezclas asimétricas (Tesis doctoral), Departamento de Ingeniería Química, Universidad Nacional del Sur, Bahía Blanca, Argentina, 2010, 233 pages. [Tesis de postgrado (Doctora en Ingeniería Química), 29 de Marzo de 2010).] URL: http://repositoriodigital.uns.edu.ar/handle/123456789/2063 *
626. Mekapati Srinivas and Gade Pandu Rangaiah, "Differential Evolution with Tabu List for Global Optimization: Evaluation of Two Versions on Benchmark and Phase Stability Problems", in: Stochastic Global Optimization: Techniques and Applications in Chemical Engineering, Vol. 2 in the Advances in Process Systems Engineering, Gade Pandu Rangaiah (Editor), World Scientific Publishing Company, Singapore, 2010, 465-504. (Chapter 14.) *
627. Akram Avami, Yadollah Saboohi, A simultaneous method for phase identification and equilibrium calculations in reactive mixtures, Chemical Engineering Research and Design, 89(10), 1901-1908, 2011. doi:10.1016/j.cherd.2010.12.013 *
628. László Pál, Global optimization algorithms for bound constrained problems, PhD Thesis, University of Szeged, PhD School in Computer Science, Szeged, 2010. *
629. A. Bonilla-Petriciolet, J.G. Segovia-Hernández, A comparative study of particle swarm optimization and its variants for phase stability and equilibrium calculations in multicomponent reactive and non-reactive systems, Fluid Phase Equilibria 289(2010), 110-121. doi:10.1016/j.fluid.2009.11.008 *
630. Paula B. Staudt, Rafael de P. Soares, Reliability vs. Efficiency When Solving Multiphase Equilibrium Problems with Hybrid Optimization Codes, Computer Aided Chemical Engineering 27(2009), 585-590. *
631. D.V. Nichita, S. Gomez, Efficient location of multiple global minima for the phase stability problem, Chemical Engineering Journal, 152(1), pp. 251-263, 2009. doi:10.1016/j.cej.2009.05.011 *
632. J.C. Ferrari, G. Nagatani, F.C. Corazza, J.V. Oliveira, and M.L. Corazza, Application of stochastic algorithms for parameter estimation in the liquid-liquid phase equilibrium modeling, Fluid Phase Equilibria, 280(1-2), pp. 110-119, 2009. *
633. L. Pál and T. Csendes, INTLAB implementation of an interval global optimization algorithm, Optimization Methods and Software, 24(2009), 749-759.
634. T. Csendes and L. Pál, A basic interval global optimization procedure for Matlab/INTLAB. In: Proceedings of International Symposium on Nonlinear Theory and its Applications (NOLTA2008), pp. 592-595, Budapest, Hungary, 2008.
635. Jalali, F., Seader, J. D., and Khaleghi, S., Global solution approaches in equilibrium and stability analysis using homotopy continuation in the complex domain, Computers & Chemical Engineering, 32(10), pp. 2333-2345, 2008. *
636. D.V. Nichita, F. García-Sánchez, S. Gómez, Phase stability analysis using the PC-SAFT equation of state and the tunneling global optimization method, Chemical Engineering Journal, 140(1-3), 509-520, 2008. *
637. Tibor Csendes, László Pál, J. Oscar H. Sendín, Julio R. Banga: The GLOBAL Optimization Method Revisited, Optimization Letters, 2(2008) 445-454.
638. N. Saber, J.M. Shaw, Rapid and robust phase behaviour stability analysis using global optimization, Fluid Phase Equilibria, 264(1-2), pp. 137-146, 2008.*
639. Chen Dong Chu, Study on Phase Equilibrium of Extraction Aromatics Using N-formylmorphoiline and Its Simulation, PhD Thesis, Dept. Chemical Technology, South Central University, China, 2007. *
640. L. Pál and T. Csendes, Improvements on the GLOBAL Optimization Algorithm with Numerical Tests. Proc. ICAI, Eger, Hungary, Vol. 2, 2007, 101-109.
641. Corazza ML, Corazza FC, Cardozo Filho L, Dariva C: A subdivision algorithm for phase equilibrium calculations at high pressures. Brazilian J. Chem. Eng. 24(2007) 611-622.*
642. Khaleghi, S., Jalali, F., Multiple solutions in stability analysis using homotopy continuation in complex space, Chemical Engineering Communications, 194(9), pp. 1241-1258, 2007. *
643. Bánhelyi B., Dinamikai rendszerek kaotikusságának és stabilitásának vizsgálata megbízható számítógépes módszerekkel, PhD dissertation, University of Szeged, 2007. *
644. Mekapati Srinivas, Stochastic global optimization methods and their applications in Chemical Engineering, Phd Thesis, National University of Singapore, 2007. *
645. Mekapati Srinivas and G.P. Rangaiah, A study of differential evolution and tabu search for benchmark, phase equilibrium and phase stability problems, Computers & Chemical Engineering, 31(7):760-772, 2007. *
646. M. Hassou, Y. Le Gorrec, C. Jallut, F. Couenne, M. Tayakout, Modélisation de l'équilibre de phases pour un systéme ternaire, SIMO 2006 -- systemes d'information, modélisation, optimisation et commande en Génie des Procédés Le virtuel dans la réalité quotidienne, 11-12 octobre 2006 - Toulouse (France). (in French) *
647. Nichita, D.V., Valencia, C.D.D., and Gomez, S., Volume-based thermodynamics global phase stability analysis, Chemical Engineering Communications 193(2006): 1194-1216. *
648. Adrián Bonilla-Petriciolet, Richart Vázquez-Román, Gustavo A. Iglesias-Silva, and Kenneth R. Hall, Performance of Stochastic Global Optimization Methods in the Calculation of Phase Stability Analyses for Nonreactive and Reactive Mixtures, Ind. Eng. Chem. Res., 45(13):4764-4772, 2006. *
649. Hassou, M., Le Gorrec, Y., Jallut, C., Couenne, F., Tayakout, M., Modelling of nanocapsules formation: Phase separation during mass transfer processes, AIChE Annual Meeting, Conference Proceedings, pp. 813-822, 2005. *
650. Srinivas, M., G.P. Rangaiah, Evaluation of differential evolution and tabu search for benchmark and phase stability problems, AIChE Annual Meeting, Conference Proceedings, pp. 6365-6382 (2005). *
651. Wakeham, W.A., Stateva, R.P., Numerical solution of the isothermal, isobaric phase equilibrium problem, Reviews in Chemical Engineering, 20(1-2), pp. 1-56., 2004.
652. Csendes T., Markót M.Cs., Szabó P.G., Tóth B., Vinkó T.: Global Optimization And Circle Packing. In: Scientific Research at the Institute of Informatics of the University of Szeged, pp. 11-16, 2000-2003.

     [BCR02] Balogh, J., T. Csendes, and T. Rapcsák, "Global optimization problems on Stiefel manifold", in: NMCM-2002 Book of Abstracts, Miskolc, Hungary (2002), pp. 19-21.

653. N.Z. Shor, P.I. Stetsyuk, and O.A. Berezovskyi, Dual bounds for special optimization qudratic type problem on Stiefel manifolds (Dvojstvennüje ocenki dlja specialnoj optimizacionnoj zadachi kvadaratichnogo tipa na mnogoobraziji Stiffelja), Teorija Optimalnüh Risenh, 3, 3-10, 2004. (in Russian) *
654. O.A. Berezovskyi, O nhizhnhej ocenke dlja odnoj kvadratichnoj zadachi na mnogoobroziji Stifelja, Kibernetika i Sistemnüj Analiz, 5, 95-103, 2008. ISSN 0023-1274 (in Russian) *
655. O.A. Berezovskyi, On the lower bound for a quadratic problem on the Stiefel manifold, Cybernetics and Systems Analysis, 44(5), 709-715, 2008. Springer US. DOI: 10.1007/s10559-008-9038-4 ISSN: 1060-0396 *

     [CMB02] Csallner A.E., Mágoriné Huhn Á., Balogh J., On the Teaching of Interval Computations, Proceedings of the 5th International Conference on Applied Informatics, pp. 31-40, 2002.

656. Csendes T., Markót M.Cs., Szabó P.G., Tóth B., Vinkó T.: Global Optimization And Circle Packing, In: Scientific Research at the Institute of Informatics of the University of Szeged, pp. 11-16, 2000-2003. *

     [BCS01] Balogh J., Csendes T. és R.P. Stateva, A fázis-stabilitás elemzése egy új célfüggvény és egy globális optimalizálási módszer fölhasználásával (In Hungarian) Magyar Kémiai Folyóirat 107(2001), 82-89.

657. D.V. Nichita, S. Gomez, Efficient location of multiple global minima for the phase stability problem, Chemical Engineering Journal, 152(1), pp. 251-263, 2009. doi:10.1016/j.cej.2009.05.011 *
658. Wakeham, W.A., Stateva, R.P., Numerical solution of the isothermal, isobaric phase equilibrium problem, Reviews in Chemical Engineering 20(1-2), pp. 1-56., 2004.
659. Csendes T., Markót M.Cs., Szabó P.G., Tóth B., Vinkó T.: Global Optimization And Circle Packing, In: Scientific Research at the Institute of Informatics of the University of Szeged, pp. 11-16, 2000-2003.
660. Csendes T. and Szabó P.G.: Nonlinear and Global Optimization, In: Scientific Research at the Institute of Informatics of the University of Szeged, pp. 5-7, 1998-2001.

     [OBG99] Ortigosa, P.M., J. Balogh, and I. García, A parallelized random search global optimization algorithm, Acta Cybernetica 14(1999), 403-418.

661. J.R. Bilbao-Castro, A. Merino, I. García, J.M. Carazo, and J.J. Fernández, Parameter optimization in 3D reconstruction on a large scale grid, Parallel Computing, 33(4-5), 250-263, 2007.
662. Hendrix, E.M.T., P.M. Ortigosa, I. García: On success rates for controlled random search, J. Global Optim. 21(3), 239-263, 2001.
663. Csendes T. and Szabó P.G.: Nonlinear and Global Optimization, In: Scientific Research at the Institute of Informatics of the University of Szeged, pp. 5-7, 1998-2001. *
664. P.M. Ortigosa: Métodos Estocásticos de Optimización Global. Procesamiento Paralelo. Tesis Doctoral. Universidad de Málaga. 1999.
665. E.M.T. Hendrix, P.M. Ortigosa, I. García: On Failure Rates for Controlled Random Search. Florenze, Italy. GO 99. International Workshop on Global Optimization. 1999.

     ---

     * Fully independent citation (there are no common authors of the cited and the citing paper)