Technical Note—Analysis of a Preference Order Traveling Salesman Problem

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

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

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

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

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1977English

The Traveling Salesman Problem

English

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

Information in the Traveling Salesman Problem

Applied Mathematics
2012English

Approximating the Euclidean Traveling Salesman Problem (TSP)

Geometric Approximation Algorithms
2011English

Solving the Traveling Salesman Problem on a Quantum Annealer

SN Applied Sciences
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy