You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/71957
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFrança, P. M.-
dc.contributor.authorUsberti, F. L.-
dc.contributor.authorMorelato, A. L.-
dc.date.accessioned2014-05-27T11:24:50Z-
dc.date.accessioned2016-10-25T18:30:20Z-
dc.date.available2014-05-27T11:24:50Z-
dc.date.available2016-10-25T18:30:20Z-
dc.date.issued2010-11-10-
dc.identifierhttp://dx.doi.org/10.1109/AICCSA.2010.5586978-
dc.identifier.citation2010 ACS/IEEE International Conference on Computer Systems and Applications, AICCSA 2010.-
dc.identifier.urihttp://hdl.handle.net/11449/71957-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/71957-
dc.language.isoeng-
dc.sourceScopus-
dc.titleThe open capacitated arc routing problem: complexity and algorithmsen
dc.typeoutro-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.contributor.institutionUniversidade Estadual de Campinas (UNICAMP)-
dc.description.affiliationSão Paulo State University, Presidente Prudente, SP, 19060-900-
dc.description.affiliationCampinas State University, Campinas, SP, 13083-852-
dc.description.affiliationUnespSão Paulo State University, Presidente Prudente, SP, 19060-900-
dc.identifier.doi10.1109/AICCSA.2010.5586978-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartof2010 ACS/IEEE International Conference on Computer Systems and Applications, AICCSA 2010-
dc.identifier.scopus2-s2.0-78049458329-
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.