Amanote Research

Amanote Research

    RegisterSign In

A QUBO Model for the Traveling Salesman Problem With Time Windows

Algorithms - Switzerland
doi 10.3390/a12110224
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputational MathematicsNumerical AnalysisTheoretical Computer ScienceComputational Theory
Date

October 25, 2019

Authors
Christos PapalitsasTheodore AndronikosKonstantinos GiannakisGeorgia TheocharopoulouSofia Fanarioti
Publisher

MDPI AG


Related search

Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem With Time Windows

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

The Traveling Salesman Problem

English

Traveling Salesman Problem

2011English

Traveling Salesman Problem

English

Optimization Approaches for the Traveling Salesman Problem With Drone

SSRN Electronic Journal
2015English

A Memetic Algorithm for the Generalized Traveling Salesman Problem

Natural Computing
Computer Science Applications
2009English

Dynamic Programming Approaches for the Traveling Salesman Problem With Drone

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2018English

Exact Algorithms for the Equitable Traveling Salesman Problem

SSRN Electronic Journal
2016English

Information in the Traveling Salesman Problem

Applied Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy