Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14398
For citation please use:
Main Title: Benchmarks for Strictly Fundamental Cycle Bases
Author(s): Liebchen, Christian
Wünsch, Gregor
Köhler, Ekkehard
Reich, Alexander
Rizzi, Romeo
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15625
http://dx.doi.org/10.14279/depositonce-14398
License: http://rightsstatements.org/vocab/InC/1.0/
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.
Subject(s): strictly fundamental cycle bases
cycle bases on grids
local search
heuristics
lower and upper bounds
Issue Date: 2007
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2007, 03
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-003-2007.pdf
Format: Adobe PDF | Size: 196.31 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.