Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction : First Results / Christian Ernst ...

Kurzanzeige
cbs.date.changed2021-02-24
cbs.date.creation2014-04-17
cbs.picatypeOa
cbs.publication.displayformHalle (Saale) : Martin-Luther-University Halle-Wittenberg, Institute of Computer Science, 2009
dc.contributor.contributorErnst, Christian
dc.date.accessioned2025-05-28T16:42:17Z
dc.date.issued2009
dc.format.extentOnline-Ressource (PDF-Datei: 14 S., 0,43 MB) : graph. Darst.
dc.genrebook
dc.identifier.ppn783242794
dc.identifier.urihttps://epflicht.bibliothek.uni-halle.de/handle/123456789/1114
dc.identifier.urnurn:nbn:de:gbv:3:2-27635
dc.identifier.vl-id1911807
dc.language.isoeng
dc.publisherMartin-Luther-University Halle-Wittenberg, Institute of Computer Science
dc.relation.ispartofseriesTechnische Berichte ; 2009,5 ppn:584751885
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subject.ddc004
dc.titleFinding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction : First Results / Christian Ernst ...
dc.typeBook
dspace.entity.typeMonograph
local.accessrights.itemAnonymous
local.openaccesstrue

Dateien

Originalbündel
Gerade angezeigt 1 - 1 von 1
Vorschaubild
Name:
urn_nbn_de_gbv_3_2-27635.pdf
Größe:
440.66 KB
Format:
Adobe Portable Document Format
Beschreibung:
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Herunterladen

Sammlungen

E-Book