Strong valid inequality constraints for architectural layout design optimization
In the past decades, many attempts have been made to solve the challenging architectural layout design problem such as non-linear programming and evolutionary algorithm (Michalek and Papalambros, 2002). The Mixed Integer Programming (MIP) (Kamol and Krung, 2005) was recently developed to find the gl...
Saved in:
Main Authors: | K. Keatruangkamala, P. Nilkaew |
---|---|
格式: | Conference Proceeding |
出版: |
2018
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=34247106817&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/61602 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Chiang Mai University |
相似書籍
-
Learning binary variables selections to improve the mip solution time in architectural layout design optimization
由: Kamol Keatruangkamala
出版: (2013) -
Mixed integer programming model with non-circular and guided constraints for architectural layout design optimization
由: Kamol Keatroangkamala, et al.
出版: (2018) -
Strong Constraints on Models that Explain the Violation of Bell Inequalities with Hidden Superluminal Influences
由: Scarani, V., et al.
出版: (2016) -
Distributed online convex optimization with time-varying coupled inequality constraints
由: Yi, Xinlei, et al.
出版: (2023) -
Distributed continuous-time nonsmooth convex optimization with coupled inequality constraints
由: Li, Xiuxian, et al.
出版: (2021)