A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
is eventually found and the method terminates. As convergence may require a large amount of computing time for hard instances, the method unsatisfactory from a heuristic point of view. Proximity Search is a recently-proposed heuristic paradigm in which the problem at hand is modified and iteratively solved with the aim of producing a sequence of improving feasible solutions. As such, Proximity Search and Benders decomposition naturally complement each other, in particular when the emphasis isdoi:10.1007/s10732-015-9306-1 fatcat:axwi7jh2kbanbemyc4vrlka2ae