<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<font color="#000000">I am pleased to say that I have spent a very
small amount of time implementing the Proximity Search heuristic
by Fischetti and Monaci.<br>
<br>
At present it is only in Cbc trunk and by default is off. The
simplest way to switch it on using stand-alone version is
"-proximity on".<br>
<br>
Proximity Search is the new "No-Neighborhood Search" 0-1 MIP
refinement heuristic recently proposed by Fischetti and Monaci
(2012). The idea is to define a sub-MIP without additional
constraints but with a modified objective function intended to
attract the search in the proximity of the incumbent. The approach
works well for 0-1 MIPs whose solution landscape is not too
irregular (meaning the there is reasonable probability of finding
an improved solution by flipping a small number of binary
variables), in particular when it is applied to the first
heuristic solutions found at the root node. Feedback about
(un)successful applications are very welcome, and can be send
directly to Matteo Fischetti (<a class="moz-txt-link-abbreviated"
href="mailto:matteo.fischetti@unipd.it">matteo.fischetti@unipd.it</a>)<br>
<br>
Feedback about unsuccessful applications may also be sent to me as
I may need to improve my implementation.<br>
<br>
John Forrest<br>
</font>
</body>
</html>