Amanote Research

Amanote Research

    RegisterSign In

Self-Crossover and Its Application to the Traveling Salesman Problem

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-48765-4_36
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1999

Authors
Malay K. KunduNikhil R. Pal
Publisher

Springer Berlin Heidelberg


Related search

A Branch-And-Bound-Based Crossover Operator for the Traveling Salesman Problem

International Journal of Cognitive Informatics and Natural Intelligence
Human-Computer InteractionArtificial IntelligenceSoftware
2019English

The Traveling Salesman Problem

English

Traveling Salesman Problem

2011English

Traveling Salesman Problem

English

An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem

American Journal of Computational Mathematics
2019English

Information in the Traveling Salesman Problem

Applied Mathematics
2012English

Approximating the Euclidean Traveling Salesman Problem (TSP)

Geometric Approximation Algorithms
2011English

A Study of the Traveling Salesman Problem Using Fuzzy Self Organizing Map

2008English

ISPO: A New Way to Solve Traveling Salesman Problem

Intelligent Control and Automation
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy