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). ALIO-INFORMS 2010 - ALIO-INFORMS Joint International Meeting.
Exportar Referência (IEEE) 
A. C. Nunes and M. C. Mourão,  "Models for the Sectoring-Arc Routing Problem (SARP)", in ALIO-INFORMS 2010 - ALIO-INFORMS Joint Int. Meeting, Buenos Aires, 2010
Exportar BibTeX 
@misc{nunes2010_1714478584169,
	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://meetings2.informs.org/BuenosAires2010/"
}
Exportar RIS 
TY  - CPAPER
TI  - Models for the Sectoring-Arc Routing Problem (SARP)
T2  - ALIO-INFORMS 2010 - ALIO-INFORMS Joint International Meeting
AU  - Nunes, Ana Catarina
AU  - Mourão, Maria Cândida
PY  - 2010
CY  - Buenos Aires
UR  - http://meetings2.informs.org/BuenosAires2010/
AB  - The Sectoring-Arc Routing Problem (SARP) models the activities associated with the streets of large urban areas, such as household waste collection. The SARP seeks to partition a mixed graph into a given number of smaller sub-graphs (sectors), and to build a set of trips in each sector.  The objective is to minimize the total duration of the trips. Linear mixed integer programming formulations are presented for the SARP, and computational results over a set of benchmark problems are reported.
ER  -