Lucas Porto Maziero. Instituto de Computação, Universidade Estadual de Campinas. Email confirmado em dac.unicamp.br. Otimização ...
I have Bachelor, Master and PhD degree in Computer Science. Currently I am Software… · Experience: Samsung Electronics · Education: Universidade Estadual de ...
In this thesis, computational methodologies are proposed for two coverage routing problems: Covering Salesman Problem (CSP) and Multi-Depot Covering Tour ...
May 5, 2024 · Lucas Porto Maziero's Post. View profile for Lucas Porto Maziero, graphic. Lucas Porto Maziero. Software Developer and PhD in Computer Science.
Mar 3, 2024 · This paper introduces the Capacitated Covering Salesman Problem (CCSP), approaching the notion of service by coverage in capacitated vehicle routing problems.
Branch-and-cut algorithms for the covering salesman problem. Lucas Porto Maziero*, Fábio Luiz Usberti and Celso Cavellucci. Institute of Computing, University ...
Título em outro idioma: Algoritmos exatos e heurísticos para problemas de roteamento por cobertura. Palavras-chave em inglês: Integer linear programming.
I'm a Master's student at the State University of Campinas (Unicamp), currently visiting LIP6. My research interests are mainly related to the foundations ...
Missing: Maziero | Show results with:Maziero
A branch-and-cut framework assembles exact and heuristic separation routines for integer and fractional CSP solutions.
