scientific article; zbMATH DE number 1933055

From MaRDI portal

Revision as of 02:11, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4405643

Jump to:navigation, search

zbMath1107.90038MaRDI QIDQ4405643

Gregory Gutin, Anders Yeo

Publication date: 23 June 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Assignment problem Traveling Salesman Problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics ⋮ A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem ⋮ Branch-and-bound for the precedence constrained generalized traveling salesman problem ⋮ A memetic algorithm for the generalized traveling salesman problem

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4405643&oldid=18433845"