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

International Journal of Cognitive Informatics and Natural Intelligence - United States
doi 10.4018/ijcini.2019070101
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IGI Global

Related search

Self-Crossover and Its Application to the Traveling Salesman Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Technical Note—On Partitioning the Feasible Set in a Branch-And-Bound Algorithm for the Asymmetric Traveling-Salesman Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1973English

The Traveling Salesman Problem

English

Traveling Salesman Problem

2011English

Traveling Salesman Problem

English

A Method for the Traveling Salesman Problem Based on the Genetic Algorithm

Transactions of the Society of Instrument and Control Engineers
1995English

A Memetic Algorithm for the Generalized Traveling Salesman Problem

Natural Computing
Computer Science Applications
2009English

UML Modeling for Traveling Salesman Problem Based on Genetic Algorithms

Southeast Europe Journal of Soft Computing
2012English

Exact Algorithms for the Equitable Traveling Salesman Problem

SSRN Electronic Journal
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy