BibTeX Export for A Model-Based Heuristic to the Min Max K-Arc Routing for Connectivity Problem

Copy to Clipboard Download

@InProceedings{akbari_et_al:OASIcs.SCOR.2014.76,
  author =	{Akbari, Vahid and Salman, Sibel},
  title =	{{A Model-Based Heuristic to the Min Max K-Arc Routing for Connectivity Problem}},
  booktitle =	{4th Student Conference on Operational Research},
  pages =	{76--88},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-67-5},
  ISSN =	{2190-6807},
  year =	{2014},
  volume =	{37},
  editor =	{Crespo Del Granado, Pedro and Joyce-Moniz, Martim and Ravizza, Stefan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2014.76},
  URN =		{urn:nbn:de:0030-drops-46714},
  doi =		{10.4230/OASIcs.SCOR.2014.76},
  annote =	{Keywords: Arc Routing Problem, Mixed Integer Programming, Heuristic, Network Connectivity, Road Clearance}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode