.png){kind=icon}
Return
Logical processing for integer programming
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-005-3974-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
integer programming
logical processing
probing
reduction to minimal preferred inequalities
covers of low degrees
persistence of signs
disaggregation
double contraction
reduction schemes
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveShareSaveAlginate surfactant derivatives as an ecofriendly corrosion inhibitor for carbon steel in acidic environments.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSaveShareSave
View more