Constructive Algorithms for the Constant Distance Traveling Tournament Problem

doi 10.1007/978-3-540-77345-0_9
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Exact Algorithms for the Equitable Traveling Salesman Problem

SSRN Electronic Journal
2016English

Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2018English

UML Modeling for Traveling Salesman Problem Based on Genetic Algorithms

Southeast Europe Journal of Soft Computing
2012English

A Tabu Search Approximation for Finding the Shortest Distance Using Traveling Salesman Problem

IOSR Journal of Mathematics
2016English

Simple Constructive, Insertion, and Improvement Heuristics Based on the Girding Polygon for the Euclidean Traveling Salesman Problem

Algorithms
MathematicsComputational MathematicsNumerical AnalysisTheoretical Computer ScienceComputational Theory
2019English

Fixed-Parameter Algorithms for Rectilinear Steiner Tree and Rectilinear Traveling Salesman Problem in the Plane

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2018English

Traveling Salesman Algorithms Complexity

International Journal of Computer Applications
2019English

The Traveling Salesman Problem

English

On Multipartite Tournament Matrices With Constant Team Size∗

Linear and Multilinear Algebra
Number TheoryAlgebra
1993English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy