Algorithms for Floor Planning with Proximity Requirements
Author:
Klawitter JonathanORCID, Klesen FelixORCID, Wolff AlexanderORCID
Publisher
Springer Singapore
Reference28 articles.
1. Ahmadi, A., Pishvaee, M.S., Akbari Jokar, M.R.: A survey on multi-floor facility layout problems. Comput. Ind. Eng. 107, 158–170 (2017). https://doi.org/10.1016/j.cie.2017.03.015 2. Allen, T.J., Fustfeld, A.R.: Research laboratory architecture and the structuring of communications. R&D Manage. 5(2), 153–164 (1975). https://doi.org/10.1111/j.1467-9310.1975.tb01230.x 3. Barth, L., et al.: Semantic word cloud representations: hardness and approximation algorithms. In: Pardo, A., Viola, A. (eds.) Latin American Symposium on Theoretical Informatics (LATIN 2014), vol. 8392, pp. 514–525. Springer (2014). https://doi.org/10.1007/978-3-642-54423-1_45 4. Bekos, M.A., et al.: Improved approximation algorithms for box contact representations. Algorithmica 77(3), 902–920 (2016). https://doi.org/10.1007/s00453-016-0121-3 5. Bergman, D., Cardonha, C., Mehrani, S.: Binary decision diagrams for bin packing with minimum color fragmentation. In: Rousseau, L., Stergiou, K. (eds.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2019), vol. 11494, pp. 57–66 (2019). https://doi.org/10.1007/978-3-030-19212-9_4
|
|