@article{Pessôa_Collazo_Lins_Bahiense_Arruda_2015, title={DYNAMIC PROGRAMMING APPLIED TO AN OCEANOGRAPHIC CAMPAIGN PLANNING}, volume={67}, url={https://seer.ufu.br/index.php/revistabrasileiracartografia/article/view/44619}, abstractNote={Oceanographic survey planning, as hydrographic survey planning, involves optimizing the path of a survey platform. Such a plat-form must visit a set of target geographic positions, each of which must be visited a single time before the platform returns to the initial harbor. This problem is similar to the Traveling Salesman Problem (TSP), though distinct enough to warrant a dedicated solution. Here this problem is modelled as a sequential optimization problem and is optimally solved using a dynamic programming algorithm.}, number={5}, journal={Revista Brasileira de Cartografia}, author={Pessôa, Leonardo Antonio Monteiro and Collazo, Rodrigo Abrunhosa and Lins, Marcos Pereira Estellita and Bahiense, Laura and Arruda, Edilson Fernandes de}, year={2015}, month={set.} }