The open capacitated arc routing problem: complexity and algorithms

dc.contributor.authorFrança, P. M. [UNESP]
dc.contributor.authorUsberti, F. L.
dc.contributor.authorMorelato, A. L.
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.contributor.institutionUniversidade Estadual de Campinas (UNICAMP)
dc.date.accessioned2014-05-27T11:24:50Z
dc.date.available2014-05-27T11:24:50Z
dc.date.issued2010-11-10
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.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.doi10.1109/AICCSA.2010.5586978
dc.identifier.scopus2-s2.0-78049458329
dc.identifier.urihttp://hdl.handle.net/11449/71957
dc.language.isoeng
dc.relation.ispartof2010 ACS/IEEE International Conference on Computer Systems and Applications, AICCSA 2010
dc.rights.accessRightsAcesso aberto
dc.sourceScopus
dc.titleThe open capacitated arc routing problem: complexity and algorithmsen
dc.typeTrabalho apresentado em evento
dcterms.licensehttp://www.ieee.org/publications_standards/publications/rights/rights_policies.html
unesp.campusUniversidade Estadual Paulista (Unesp), Faculdade de Ciências e Tecnologia, Presidente Prudentept

Arquivos