.png){kind=icon}
返回
A learn-and-construct framework for general mixed-integer programming problems
.png){kind=icon}
OA
AI
DOI：10.1111/itor.12578.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a new framework for finding an initial feasible solution from a mixed-integer programming (MIP) model. We call it learn-and-construct since it first exploits the structure of the model and its linear relaxation solution and then uses this knowledge to try to produce a feasible solution. In the learning phase, we use an unsupervised learning algorithm to cluster entities originating the MIP model. Such clusters are then used to decompose the original MIP in a number of easier sub-MIPs that are solved by using a black box solver. Computational results on three well-known problems show that our procedure is characterized by a success rate larger than both the feasibility pump heuristic and a state-of-the-art MIP solver. Furthermore, our approach is more scalable and uses less computing time on average.
Keyword:
mixed-integer programming
heuristics
feasible solution
unsupervised learning
optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
分享收藏MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
PREAI
分享收藏Hierarchical-Variational Mode Decomposition for Baseline Correction in Electroencephalogram Signals
OAAI
OAAI分享收藏Recovery of salinity gradient energy in desalination plants by reverse electrodialysis.png)
DesalinationOAAI
DesalinationIF0
OAAI分享收藏Alginate surfactant derivatives as an ecofriendly corrosion inhibitor for carbon steel in acidic environmentsRSC Advances
RSC AdvancesIF0
PREAI
分享收藏
查看更多内容