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...
محفوظ في:
المؤلفون الرئيسيون: | K. Keatruangkamala, P. Nilkaew |
---|---|
التنسيق: | وقائع المؤتمر |
منشور في: |
2018
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=34247106817&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/61602 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Learning binary variables selections to improve the mip solution time in architectural layout design optimization
بواسطة: Kamol Keatruangkamala
منشور في: (2013) -
Learning binary variables selections to improve the mip solution time in architectural layout design optimization
بواسطة: Kamol Keatruangkamala
منشور في: (2007) -
Mixed integer programming model with non-circular and guided constraints for architectural layout design optimization
بواسطة: Kamol Keatroangkamala, وآخرون
منشور في: (2018) -
Strong Constraints on Models that Explain the Violation of Bell Inequalities with Hidden Superluminal Influences
بواسطة: Scarani, V., وآخرون
منشور في: (2016) -
Distributed online convex optimization with time-varying coupled inequality constraints
بواسطة: Yi, Xinlei, وآخرون
منشور في: (2023)