A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints (1997)
Ferreira, Carlos Eduardo 
; Loparic, Marko
Assunto: PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Carlos Eduardo e LOPARIC, Marko. A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/7121bf05-5fde-4c02-8c7b-bf8a04efe128/975467.pdf. Acesso em: 09 nov. 2025. , 1997APA
Ferreira, C. E., & Loparic, M. (1997). A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/7121bf05-5fde-4c02-8c7b-bf8a04efe128/975467.pdfNLM
Ferreira CE, Loparic M. A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints [Internet]. 1997 ;[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/7121bf05-5fde-4c02-8c7b-bf8a04efe128/975467.pdfVancouver
Ferreira CE, Loparic M. A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints [Internet]. 1997 ;[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/7121bf05-5fde-4c02-8c7b-bf8a04efe128/975467.pdf
