| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6895092 | European Journal of Operational Research | 2018 | 35 Pages |
Abstract
The proposed approach is applicable to complex problems. It applies CP and MIP sequentially, while exploring their advantages, and hybridizes heuristic search with MIP. It embeds a new lookahead strategy that guards against infeasible search directions and constrains the search to improving directions only; thus, differs from traditional lookahead beam searches.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Sergey Polyakovskiy, Rym M'Hallah,