Branch-and-bound algorithms for capacitated lot-sizing in parallel machines (2007)
Unidade: ICMCAssunto: OTIMIZAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TOLEDO, Franklina Maria Bragion de e ARMENTANO, Vinícius Amaral. Branch-and-bound algorithms for capacitated lot-sizing in parallel machines. . São Carlos: ICMC-USP. Disponível em: https://repositorio.usp.br/directbitstream/e92eae66-3f68-47c4-aa7a-c5bb3edb7d3b/1588138.pdf. Acesso em: 30 set. 2024. , 2007APA
Toledo, F. M. B. de, & Armentano, V. A. (2007). Branch-and-bound algorithms for capacitated lot-sizing in parallel machines. São Carlos: ICMC-USP. Recuperado de https://repositorio.usp.br/directbitstream/e92eae66-3f68-47c4-aa7a-c5bb3edb7d3b/1588138.pdfNLM
Toledo FMB de, Armentano VA. Branch-and-bound algorithms for capacitated lot-sizing in parallel machines [Internet]. 2007 ;[citado 2024 set. 30 ] Available from: https://repositorio.usp.br/directbitstream/e92eae66-3f68-47c4-aa7a-c5bb3edb7d3b/1588138.pdfVancouver
Toledo FMB de, Armentano VA. Branch-and-bound algorithms for capacitated lot-sizing in parallel machines [Internet]. 2007 ;[citado 2024 set. 30 ] Available from: https://repositorio.usp.br/directbitstream/e92eae66-3f68-47c4-aa7a-c5bb3edb7d3b/1588138.pdf