FERN: An Exact Algorithm for the Euclidean Traveling Salesman Problem (TSP)

FERN-Ref v0.1 is a reproducible preprint and reference implementation for an exact algorithm addressing the Euclidean Traveling Salesman Problem (TSP). The record contains the manuscript, source files, executable reference code, regression tests, and raw experimental data. The work documents the algorithmic specification, prior-art attribution, exactness conditions, experimental validation, and the open question of whether the reachable-state space admits a polynomial worst-case bound.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-28
DOI
https://doi.org/10.5281/zenodo.23020674
Primary Topic
Vehicle Routing Optimization Methods
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

FERN: An Exact Algorithm for the Euclidean Traveling Salesman Problem (TSP)

Peter Walcott
Zenodo (CERN European Organization for Nuclear Research)
Vehicle Routing Optimization Methods
preprint

FERN: An Exact Algorithm for the Euclidean Traveling Salesman Problem (TSP)

Peter Walcott
preprint en

Abstract

FERN-Ref v0.1 is a reproducible preprint and reference implementation for an exact algorithm addressing the Euclidean Traveling Salesman Problem (TSP). The record contains the manuscript, source files, executable reference code, regression tests, and raw experimental data. The work documents the algorithmic specification, prior-art attribution, exactness conditions, experimental validation, and the open question of whether the reachable-state space admits a polynomial worst-case bound.

Zenodo (CERN European Organization for Nuclear Research)
Vehicle Routing Optimization Methods
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

FERN: An Exact Algorithm for the Euclidean Traveling Salesman Problem (TSP) — Peter Walcott · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS