ReP USP - Resultado da busca

Relatorio tecnico
3-Nested institutions - an organizational design to pattern to optimize distributed workflows in electronic government (2010)
Silva, Flávio Soares Corrêa da
Unidade: IME
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
SILVA, Flávio Soares Corrêa da. 3-Nested institutions - an organizational design to pattern to optimize distributed workflows in electronic government. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/88a9f433-f50a-4ffd-8484-ce1d771d95b1/1833687.pdf. Acesso em: 09 nov. 2025. , 2010
APA
Silva, F. S. C. da. (2010). 3-Nested institutions - an organizational design to pattern to optimize distributed workflows in electronic government. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/88a9f433-f50a-4ffd-8484-ce1d771d95b1/1833687.pdf
NLM
Silva FSC da. 3-Nested institutions - an organizational design to pattern to optimize distributed workflows in electronic government [Internet]. 2010 ;[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/88a9f433-f50a-4ffd-8484-ce1d771d95b1/1833687.pdf
Vancouver
Silva FSC da. 3-Nested institutions - an organizational design to pattern to optimize distributed workflows in electronic government [Internet]. 2010 ;[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/88a9f433-f50a-4ffd-8484-ce1d771d95b1/1833687.pdf
Relatorio tecnico
Timesaver - virtual worlds and active worksflows to deliver friendly public services (2010)
Silva, Flávio Soares Corrêa da ; Araújo, Claudia Josimar Abrão de; Alberti, Lisney; Alarcon, Rosa; Vairetti, Carla; Bellido, Jesus
Unidade: IME
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
SILVA, Flávio Soares Corrêa da et al. Timesaver - virtual worlds and active worksflows to deliver friendly public services. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/ea7ef492-500d-47c6-b9bb-ca339361de3c/1833691.pdf. Acesso em: 09 nov. 2025. , 2010
APA
Silva, F. S. C. da, Araújo, C. J. A. de, Alberti, L., Alarcon, R., Vairetti, C., & Bellido, J. (2010). Timesaver - virtual worlds and active worksflows to deliver friendly public services. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/ea7ef492-500d-47c6-b9bb-ca339361de3c/1833691.pdf
NLM
Silva FSC da, Araújo CJA de, Alberti L, Alarcon R, Vairetti C, Bellido J. Timesaver - virtual worlds and active worksflows to deliver friendly public services [Internet]. 2010 ;[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/ea7ef492-500d-47c6-b9bb-ca339361de3c/1833691.pdf
Vancouver
Silva FSC da, Araújo CJA de, Alberti L, Alarcon R, Vairetti C, Bellido J. Timesaver - virtual worlds and active worksflows to deliver friendly public services [Internet]. 2010 ;[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/ea7ef492-500d-47c6-b9bb-ca339361de3c/1833691.pdf
Relatorio tecnico
A branch-and-cut algorithm for a vehicle routing problem with capacity and time constraints (1997)
Ferreira, Carlos Eduardo ; Loparic, Marko
Unidade: IME
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. , 1997
APA
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.pdf
NLM
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
Vancouver
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
Relatorio tecnico
Facets of the clique partitioning polytope (1988)
Grotschel, M; Wakabayashi, Yoshiko
Unidade: IME
Subjects: PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE, COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROTSCHEL, M e WAKABAYASHI, Yoshiko. Facets of the clique partitioning polytope. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/cac3cc2f-a61a-4992-8218-9f4c9309dbb4/775446.pdf. Acesso em: 09 nov. 2025. , 1988
APA
Grotschel, M., & Wakabayashi, Y. (1988). Facets of the clique partitioning polytope. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/cac3cc2f-a61a-4992-8218-9f4c9309dbb4/775446.pdf
NLM
Grotschel M, Wakabayashi Y. Facets of the clique partitioning polytope [Internet]. 1988 ;[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/cac3cc2f-a61a-4992-8218-9f4c9309dbb4/775446.pdf
Vancouver
Grotschel M, Wakabayashi Y. Facets of the clique partitioning polytope [Internet]. 1988 ;[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/cac3cc2f-a61a-4992-8218-9f4c9309dbb4/775446.pdf

USP Schools

ReP

Filtros

Authors