Benchmarks for Strictly Fundamental Cycle Bases

dc.contributor.author	Liebchen, Christian
dc.contributor.author	Wünsch, Gregor
dc.contributor.author	Köhler, Ekkehard
dc.contributor.author	Reich, Alexander
dc.contributor.author	Rizzi, Romeo
dc.date.accessioned	2021-12-17T10:07:37Z
dc.date.available	2021-12-17T10:07:37Z
dc.date.issued	2007
dc.description.abstract	In the Minimum Strictly Fundamental Cycle Basis (MSFCB) problem one is looking for a spanning tree such that the sum of the lengths of its induced fundamental circuits is minimum.	en
dc.identifier.issn	2197-8085
dc.identifier.uri	https://depositonce.tu-berlin.de/handle/11303/15625
dc.identifier.uri	http://dx.doi.org/10.14279/depositonce-14398
dc.language.iso	en	en
dc.rights.uri	http://rightsstatements.org/vocab/InC/1.0/	en
dc.subject.ddc	510 Mathematik	en
dc.subject.other	strictly fundamental cycle bases	en
dc.subject.other	cycle bases on grids	en
dc.subject.other	local search	en
dc.subject.other	heuristics	en
dc.subject.other	lower and upper bounds	en
dc.title	Benchmarks for Strictly Fundamental Cycle Bases	en
dc.type	Research Paper	en
dc.type.version	submittedVersion	en
tub.accessrights.dnb	free	en
tub.affiliation	Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik	de
tub.affiliation.faculty	Fak. 2 Mathematik und Naturwissenschaften	de
tub.affiliation.institute	Inst. Mathematik	de
tub.publisher.universityorinstitution	Technische Universität Berlin	en
tub.series.issuenumber	2007, 03	en
tub.series.name	Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin	en

Files

Now showing 1 - 1 of 1