3 search results - page 1 / 1 » Variable neighbourhood decomposition search for 0-1 mixed in... |
COR
2010
13 years 5 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
COR
2010
13 years 5 months ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
ENDM
2010
13 years 2 months ago
2010
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Exte...