RighiSala08 10.1016/j.cor.2008.01.003 doi Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming 2009 We present an exact optimization algorithm for the Orienteering Problem with Time Windows (OPTW). The algorithm is based on bi-directional and bounded dynamic programming with decremental state space relaxation. We compare different strategies proposed in the literature to guide decremental state space relaxation: our experiments on instances derived from the literature show that there is no dominance between these strategies. We also propose a new heuristic technique to initialize the critical vertex set and we provide experimental evidence of its effectiveness Righini, G. Salani, Matteo 1191-1203 Computers & Operations Research 0305-0548 36 4 2009 http://www.elsevier.com/locate/cor TRANSP-OR EPFL
Fatal error: Uncaught Error: Call to undefined function ereg() in E:\Inetpub\transp-or.epfl.ch\web\oneMarcXML.php:230 Stack trace: #0 {main} thrown in E:\Inetpub\transp-or.epfl.ch\web\oneMarcXML.php on line 230