.png){kind=icon}
返回
Grammatical evolution for constraint synthesis for mixed-integer linear programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2021.100896.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Mixed-Integer Linear Programming models are a common representation of real-world objects. They support simulation within the expressed bounds using constraints and optimization of an objective function. Unfortu-nately, handcrafting a model that aligns well with reality is time-consuming and error-prone. In this work, we propose a Grammatical Evolution for Constraint Synthesis (GECS) algorithm that helps human experts by synthe-sizing constraints for Mixed-Integer Linear Programming models. Given relatively easy-to-provide data of avail-able variables and parameters, and examples of feasible solutions, GECS produces a well-formed Mixed-Integer Linear Programming model in the ZIMPL modeling language. GECS outperforms several previous algorithms, copes well with tens of variables, and seems to be resistant to the curse of dimensionality.
Keyword:
Mathematical programming
Model acquisition
Constraint learning
High-level modeling language
Operations research
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
.png){kind=icon}
A semi-supervised Genetic Programming method for dealing with noisy labels and hidden overfitting
OAAI
OAAI分享收藏One-class synthesis of constraints for Mixed-Integer Linear Programming with C4.5 decision trees
PREAI
分享收藏Ellipsoidal one-class constraint acquisition for quadratically constrained programming二次约束规划的椭球一类约束获取
PREAI
分享收藏
查看更多内容