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 (2008). The Sectoring-Arc Routing Problem (SARP): Models and lower bounds. INFORMS 2008 - The Institute for Operations Research and Management Sciences Annual Meeting.
Exportar Referência (IEEE) 
A. C. Nunes and M. C. Mourão,  "The Sectoring-Arc Routing Problem (SARP): Models and lower bounds", in INFORMS 2008 - The Institute for Operations Research and Management Sciences Annu. Meeting, Washington DC, 2008
Exportar BibTeX 
@misc{nunes2008_1730877751995,
	author = "Nunes, Ana Catarina and Mourão, Maria Cândida",
	title = "The Sectoring-Arc Routing Problem (SARP): Models and lower bounds",
	year = "2008",
	howpublished = "Ambos (impresso e digital)",
	url = "http://meetings2.informs.org/DC08/index.html"
}
Exportar RIS 
TY  - CPAPER
TI  - The Sectoring-Arc Routing Problem (SARP): Models and lower bounds
T2  - INFORMS 2008 - The Institute for Operations Research and Management Sciences Annual Meeting
AU  - Nunes, Ana Catarina
AU  - Mourão, Maria Cândida
PY  - 2008
CY  - Washington DC
UR  - http://meetings2.informs.org/DC08/index.html
AB  - The Sectoring-Arc Routing Problem (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, such that the total duration of the trips is minimized. The SARP models activities associated with the streets of large urban areas, such as household waste collection. Linear mixed integer programming models and lower bounds are presented. Computational results over a set of benchmark problems are reported and analyzed.
ER  -