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

Operations Research- United States

doi 10.1287/opre.28.4.1018

Full Text

Abstract

Available in

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

Traveling Salesman Problem

2011English

The Traveling Salesman Problem

English

Traveling Salesman Problem

English

An Efficient Two-Phase Metaheuristic Algorithm for the Time Dependent Traveling Salesman Problem

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
2019English

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

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1977English

Information in the Traveling Salesman Problem

Applied Mathematics
2012English

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

A QUBO Model for the Traveling Salesman Problem With Time Windows

Algorithms
MathematicsComputational MathematicsNumerical AnalysisTheoretical Computer ScienceComputational Theory
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy