Kwang Mong Sim

Personal Details

First Name:	Kwang Mong
Middle Name:
Last Name:	Sim
Suffix:
RePEc Short-ID:	psi1173
	[This author has chosen not to make the email address public]
	https://member.acm.org/~kmsim

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Articles

1. Kwang Mong Sim, 2023. "An Incentive-Compatible and Computationally Efficient Fog Bargaining Mechanism," Computational Economics, Springer;Society for Computational Economics, vol. 62(4), pages 1883-1918, December.

   Cited by:

   1. Kwang Mong Sim, 2024. "A Strongly Group Strategyproof and Shill Resistant Bargaining Mechanism for Fog Resource Pricing," Dynamic Games and Applications, Springer, vol. 14(5), pages 1238-1267, November.

2. Seokho Son & Kwang Mong Sim, 2015. "Adaptive and similarity-based tradeoff algorithms in a price-timeslot-QoS negotiation system to establish cloud SLAs," Information Systems Frontiers, Springer, vol. 17(3), pages 565-589, June.

   Cited by:

   1. Li Chunlin & Li LaYuan, 2017. "Optimal scheduling across public and private clouds in complex hybrid cloud environment," Information Systems Frontiers, Springer, vol. 19(1), pages 1-12, February.
   2. Bahador Shojaiemehr & Marjan Kuchaki Rafsanjani, 2018. "A supplier offer modification approach based on fuzzy systems for automated negotiation in e-commerce," Information Systems Frontiers, Springer, vol. 20(1), pages 143-160, February.
   3. Sanjaya K. Panda & Indrajeet Gupta & Prasanta K. Jana, 0. "Task scheduling algorithms for multi-cloud systems: allocation-aware approach," Information Systems Frontiers, Springer, vol. 0, pages 1-19.
   4. Bahador Shojaiemehr & Marjan Kuchaki Rafsanjani, 0. "A supplier offer modification approach based on fuzzy systems for automated negotiation in e-commerce," Information Systems Frontiers, Springer, vol. 0, pages 1-18.
   5. Sanjaya K. Panda & Indrajeet Gupta & Prasanta K. Jana, 2019. "Task scheduling algorithms for multi-cloud systems: allocation-aware approach," Information Systems Frontiers, Springer, vol. 21(2), pages 241-259, April.

3. J. Octavio Gutierrez-Garcia & Kwang Mong Sim, 2012. "GA-based cloud resource estimation for agent-based execution of bag-of-tasks applications," Information Systems Frontiers, Springer, vol. 14(4), pages 925-951, September.

   Cited by:

   1. Li Chunlin & Li LaYuan, 2017. "Optimal scheduling across public and private clouds in complex hybrid cloud environment," Information Systems Frontiers, Springer, vol. 19(1), pages 1-12, February.
   2. Chulhwan Chris Bang, 2015. "Information systems frontiers: Keyword analysis and classification," Information Systems Frontiers, Springer, vol. 17(1), pages 217-237, February.
   3. John Oredo & Denis Dennehy, 2023. "Exploring the Role of Organizational Mindfulness on Cloud Computing and Firm Performance: The Case of Kenyan Organizations," Information Systems Frontiers, Springer, vol. 25(5), pages 2029-2050, October.
   4. Sanjaya K. Panda & Indrajeet Gupta & Prasanta K. Jana, 0. "Task scheduling algorithms for multi-cloud systems: allocation-aware approach," Information Systems Frontiers, Springer, vol. 0, pages 1-19.
   5. Shuai Yuan & Sanjukta Das & Ram Ramesh & Chunming Qiao, 2023. "Availability-Aware Virtual Resource Provisioning for Infrastructure Service Agreements in the Cloud," Information Systems Frontiers, Springer, vol. 25(4), pages 1495-1512, August.
   6. Haoyi Xiong & Daqing Zhang & Daqiang Zhang & Vincent Gauthier & Kun Yang & Monique Becker, 2014. "MPaaS: Mobility prediction as a service in telecom cloud," Information Systems Frontiers, Springer, vol. 16(1), pages 59-75, March.
   7. Jason J. Jung & Yue-Shan Chang & Ying Liu & Chao-Chin Wu, 2012. "Advances in intelligent grid and cloud computing," Information Systems Frontiers, Springer, vol. 14(4), pages 823-825, September.
   8. Sanjaya K. Panda & Indrajeet Gupta & Prasanta K. Jana, 2019. "Task scheduling algorithms for multi-cloud systems: allocation-aware approach," Information Systems Frontiers, Springer, vol. 21(2), pages 241-259, April.

4. Leung, Stephen C.H. & Zhang, Defu & Sim, Kwang Mong, 2011. "A two-stage intelligent search algorithm for the two-dimensional strip packing problem," European Journal of Operational Research, Elsevier, vol. 215(1), pages 57-69, November.

   Cited by:

   1. Jean-François Côté & Mohamed Haouari & Manuel Iori, 2021. "Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 963-978, July.
   2. Côté, J.F. & Guastaroba, G. & Speranza, M.G., 2017. "The value of integrating loading and routing," European Journal of Operational Research, Elsevier, vol. 257(1), pages 89-105.
   3. Lei Wang & Aihua Yin, 2016. "A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 416-444, August.
   4. Hong, Shaohui & Zhang, Defu & Lau, Hoong Chuin & Zeng, XiangXiang & Si, Yain-Whar, 2014. "A hybrid heuristic algorithm for the 2D variable-sized bin packing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 95-103.
   5. Jean-François Côté & Mauro Dell'Amico & Manuel Iori, 2014. "Combinatorial Benders' Cuts for the Strip Packing Problem," Operations Research, INFORMS, vol. 62(3), pages 643-661, June.
   6. Jean-François Côté & Michel Gendreau & Jean-Yves Potvin, 2020. "The Vehicle Routing Problem with Stochastic Two-Dimensional Items," Transportation Science, INFORMS, vol. 54(2), pages 453-469, March.
   7. Wang, Mengyao & Zhou, Chenhao & Wang, Aihu, 2022. "A cluster-based yard template design integrated with yard crane deployment using a placement heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
   8. Stéphane Grandcolas & Cyril Pain-Barre, 2022. "A hybrid metaheuristic for the two-dimensional strip packing problem," Annals of Operations Research, Springer, vol. 309(1), pages 79-102, February.
   9. Bortfeldt, Andreas, 2013. "A reduction approach for solving the rectangle packing area minimization problem," European Journal of Operational Research, Elsevier, vol. 224(3), pages 486-496.
   10. de Queiroz, Thiago A. & Miyazawa, Flávio K., 2013. "Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints," International Journal of Production Economics, Elsevier, vol. 145(2), pages 511-530.
   11. Wei, Lijun & Zhu, Wenbin & Lim, Andrew & Liu, Qiang & Chen, Xin, 2018. "An adaptive selection approach for the 2D rectangle packing area minimization problem," Omega, Elsevier, vol. 80(C), pages 22-30.
   12. Kirolos Abdou & Amgad Fakhry Ibrahim & Kai Binder & Marco F. Huber, 2026. "Nest smarter, not harder: a hybrid vision-based deep reinforcement learning agent for packing 2D irregular geometries by rotational placement," Journal of Intelligent Manufacturing, Springer, vol. 37(4), pages 1753-1767, April.
   13. He, Kun & Ji, Pengli & Li, Chumin, 2015. "Dynamic reduction heuristics for the rectangle packing area minimization problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 674-685.
   14. Kaiyuan Liu & Hongyu Zhang & Chong Wang & Hui Li & Yongquan Chen & Qiong Chen, 2023. "Robust Optimization for the Two-Dimensional Strip-Packing Problem with Variable-Sized Bins," Mathematics, MDPI, vol. 11(23), pages 1-22, November.
   15. Akçay, Fatih Burak & Delorme, Maxence, 2025. "Solving the parallel processor scheduling and bin packing problems with contiguity constraints: Mathematical models and computational studies," European Journal of Operational Research, Elsevier, vol. 323(3), pages 701-723.
   16. Defu Zhang & Yuxin Che & Furong Ye & Yain-Whar Si & Stephen C. H. Leung, 2016. "A hybrid algorithm based on variable neighbourhood for the strip packing problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 513-530, August.
   17. Gabriele Calzavara & Manuel Iori & Marco Locatelli & Mayron C. O. Moreira & Tiago Silveira, 2025. "Mathematical models and heuristic algorithms for pallet building problems with practical constraints," Annals of Operations Research, Springer, vol. 350(1), pages 5-36, July.
   18. Rosephine G. Rakotonirainy & Jan H. Vuuren, 2021. "The effect of benchmark data characteristics during empirical strip packing heuristic performance evaluation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 467-495, June.
   19. Bouzid, Mouaouia Cherif & Salhi, Said, 2020. "Packing rectangles into a fixed size circular container: Constructive and metaheuristic search approaches," European Journal of Operational Research, Elsevier, vol. 285(3), pages 865-883.
   20. Zhang, Zhenzhen & Wei, Lijun & Lim, Andrew, 2015. "An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 20-35.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Kwang Mong Sim should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.