A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints (1997)
Unidade: IMEAssunto: PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE
ABNT
FERREIRA, Carlos Alberto 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: 10 nov. 2024. , 1997APA
Ferreira, C. A., & 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 CA, Loparic M. A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints [Internet]. 1997 ;[citado 2024 nov. 10 ] Available from: https://repositorio.usp.br/directbitstream/7121bf05-5fde-4c02-8c7b-bf8a04efe128/975467.pdfVancouver
Ferreira CA, Loparic M. A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints [Internet]. 1997 ;[citado 2024 nov. 10 ] Available from: https://repositorio.usp.br/directbitstream/7121bf05-5fde-4c02-8c7b-bf8a04efe128/975467.pdf