Results 91 to 100 of about 5,636,127 (168)

Evaluating quantum-classical heuristics for traveling salesman problem

open access: yesDiscrete and Continuous Models and Applied Computational Science
In this paper, we develop and evaluate a hybrid quantum-classical heuristic approach to solving the Traveling Salesman Problem. This approach uses exhaustive enumeration of the starting paths and optimizes the remainder of the route using quantum ...
Mariia A. Makarova   +4 more
doaj   +1 more source

On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96) [PDF]

open access: yes
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment ...
Klerk, E. de   +2 more
core  

AutoRL-Sim: Automated Reinforcement Learning Simulator for Combinatorial Optimization Problems

open access: yesModelling
Reinforcement learning is a crucial area of machine learning, with a wide range of applications. To conduct experiments in this research field, it is necessary to define the algorithms and parameters to be applied.
Gleice Kelly Barbosa Souza   +1 more
doaj   +1 more source

Developing an efficient heuristic algorithm for multiple traveling salesman problem

open access: yes, 2020
The Traveling Salesman Problem is a non-deterministic polynomial problem. The Multiple Traveling Salesman Problem is one of the generalizations of the traveling salesman problem in which more than one salesperson is allowed.
Kankotiya, Gaurang
core  

Home - About - Disclaimer - Privacy