Exportar Publicação

A publicação pode ser exportada nos seguintes formatos: referência da APA (American Psychological Association), referência do IEEE (Institute of Electrical and Electronics Engineers), BibTeX e RIS.

Exportar Referência (APA)
Nunes, Ana Catarina & Mourão, Maria Cândida (2010). Models for the Sectoring-Arc Routing Problem (SARP). Euro XXIV - 24th European Conference on Operational Research.
Exportar Referência (IEEE)
A. C. Nunes and M. C. Mourão,  "Models for the Sectoring-Arc Routing Problem (SARP)", in Euro XXIV - 24th European Conf. on Operational Research, Lisboa, 2010
Exportar BibTeX
@misc{nunes2010_1732201247829,
	author = "Nunes, Ana Catarina and Mourão, Maria Cândida",
	title = "Models for the Sectoring-Arc Routing Problem (SARP)",
	year = "2010",
	howpublished = "Ambos (impresso e digital)",
	url = "http://www.euro2010lisbon.org/"
}
Exportar RIS
TY  - CPAPER
TI  - Models for the Sectoring-Arc Routing Problem (SARP)
T2  - Euro XXIV - 24th European Conference on Operational Research
AU  - Nunes, Ana Catarina
AU  - Mourão, Maria Cândida
PY  - 2010
CY  - Lisboa
UR  - http://www.euro2010lisbon.org/
AB  - The Sectoring-Arc Routing Problem (SARP) models the activities associated with the streets of large urban areas, such as waste collection. The SARP is defined over a mixed graph. Its aim is to identify a given number of similar sectors (sub-graphs) and to build a set of collecting trips in each sector, such that the total duration of the trips is minimized. Each sector is collected by one vehicle and each of its trips can not exceed a given load. Linear mixed integer programming formulations are presented for the SARP, and computational results over a set of benchmark problems are reported.
ER  -