返回
Logical processing for integer programming
DOI:10.1007/s10479-005-3974-4.png)
摘要
En 中文
This paper reviews tools which have great potential for reducing the difficulty of solving IP (and also MIP) problems, if well implemented in solvers. Recent experiments with Branch and Bound solvers, in connection with Short Start Features, have shown that implementations need and can still be improved. Concepts which are likely to be specially important for (0,1) MIP are pointed out.
Keyword:
integer programming
logical processing
probing
reduction to minimal preferred inequalities
covers of low degrees
persistence of signs
disaggregation
double contraction
reduction schemes
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
暂无机构信息
引用论文
Alginate surfactant derivatives as an ecofriendly corrosion inhibitor for carbon steel in acidic environments
RSC Advances
IF0

