Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Júnior, Teobaldo"'
Autor:
Sousa Filho, Gilberto1 gilberto@ci.ufpb.br, Júnior, Teobaldo1 teobaldoleite@ci.ufpb.br, Cabral, Lucidio1 lucidio@ci.ufpb.br, Ochi, Luiz2 satoru@ic.uff.br, Protti, Fábio2 fabio@ic.uff.br
Publikováno v:
Annals of Operations Research. Nov2017, Vol. 258 Issue 2, p781-814. 34p.
Publikováno v:
Repositório Institucional do IFPB
Instituto Federal da Paraíba (IFPB)
instacron:IFPB
Instituto Federal da Paraíba (IFPB)
instacron:IFPB
Submitted by Thiago Oliveira (thiago.oliveira@ifpb.edu.br) on 2022-08-15T15:26:03Z No. of bitstreams: 2 Dissertacao - TEOBALDO GABRIEL DE SOUZA JÚNIOR.pdf: 26059677 bytes, checksum: 50f2a8266cf0aa06c3874da8517e3730 (MD5) pos-graduacao-ifpb_-_termo_d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3056::bc0f2a81a81960662d1340c743236b8a
http://repositorio.ifpb.edu.br/jspui/handle/177683/2313
http://repositorio.ifpb.edu.br/jspui/handle/177683/2313
Autor:
Sousa Filho, Gilberto F.1 gilberto@ci.ufpb.br, Júnior, Teobaldo L. Bulhões1 teobaldoleite@ci.ufpb.br, Cabral, Lucídio dos Anjos F.1 lucidio@ci.ufpb.br, Ochi, Luiz Satoru2 satoru@ic.uff.br, Protti, Fábio2 fabio@ic.uff.br
Publikováno v:
International Transactions in Operational Research. May2016, Vol. 23 Issue 3, p409-431. 23p. 4 Diagrams, 10 Charts, 4 Graphs.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
FONSECA, Wéverton José Lima, FONSECA, Wéverson Lima, BORGES, Laylson da Silva, EVANGELISTA, Amauri Felipe, SOUSA, Paulo Henrique Amaral Araújo de, do NASCIMENTO, Genilson Sousa, de FIQUEIREDO, Carlandia Pacheco, de ALMEIDA JÚNIOR, Teobaldo Florêncio, GUERRAS, Leandro de Oliveira, CAVALCANTE, Diego Helcias, de SOUSA JÚNIOR, Severino Cavalcante
Publikováno v:
Nucleus Animalium; nov2015, Vol. 7 Issue 2, p83-92, 10p
Publikováno v:
Biblioteca Digital de Teses e Dissertações da UFPB
Universidade Federal da Paraíba (UFPB)
instacron:UFPB
Universidade Federal da Paraíba (UFPB)
instacron:UFPB
The Vehicle Routing Problem (VRP) is a classical combinatorial optimization problem widely studied in the literature. By de nition, it consists in determining least-cost routes, starting and ending at the depot, to meet the demands of a set of custom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3056::1785b580f37a8cea1dc36abe0be5e1da
https://repositorio.ufpb.br/jspui/handle/123456789/25260
https://repositorio.ufpb.br/jspui/handle/123456789/25260
Publikováno v:
Biblioteca Digital de Teses e Dissertações da UFPB
Universidade Federal da Paraíba (UFPB)
instacron:UFPB
Universidade Federal da Paraíba (UFPB)
instacron:UFPB
Vehicle routing problems arise in many practical situations in the context of transportation logistics. Among them, we can highlight the problem of transporting customers from origin to destination locations, this problem is known as the dial-a-ride
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3056::963b73789a494d3778c14ebf4eda2971
https://repositorio.ufpb.br/jspui/handle/123456789/21320
https://repositorio.ufpb.br/jspui/handle/123456789/21320
Autor:
Fragoso, Felipe Crispim
Publikováno v:
Biblioteca Digital de Teses e Dissertações da UFPB
Universidade Federal da Paraíba (UFPB)
instacron:UFPB
Universidade Federal da Paraíba (UFPB)
instacron:UFPB
The complete bipartite graph K1,3 is a tree known as claw. A graph is considered to be claw-free if it does not contain any induced subgraph isomorphic to the complete bipartite graph K1,3. Consider a graph G, the NP-Hard Graph Declawing Problem (GDP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3056::9a2a5806355ba147d21898256449c59f
https://repositorio.ufpb.br/jspui/handle/123456789/18121
https://repositorio.ufpb.br/jspui/handle/123456789/18121