Technical Note—An Effective Heuristic for theM-Tour Traveling Salesman Problem With Some Side Conditions

Operations Research - United States
doi 10.1287/opre.25.3.517
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Technical Note—Analysis of a Preference Order Traveling Salesman Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1981English

Technical Note—Ann-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1980English

Traveling Salesman Problem

2011English

Traveling Salesman Problem

English

A Note on a New Greedy-Solution Representation and a New Greedy Parallelizable Heuristic for the Traveling Salesman Problem

Chaos, Solitons and Fractals
Nonlinear PhysicsApplied MathematicsStatisticalMathematicsAstronomyPhysics
2002English

The Traveling Salesman Problem

English

An Adaptive Evolutionary Algorithm for Traveling Salesman Problem With Precedence Constraints

The Scientific World Journal
BiochemistryMedicineGeneticsMolecular BiologyEnvironmental Science
2014English

Optimization Approaches for the Traveling Salesman Problem With Drone

SSRN Electronic Journal
2015English

Meta-Heuristic Combining Genetics Algorithm and Statistical Probality to Solve Traveling Salesman Problem.

Journal of Computer Science and Cybernetics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy