Linear Programming Formulation of the Multi-Depot Multiple Traveling Salesman Problem With Differentiated Travel Costs

doi 10.5772/12927
Full Text
Abstract

Available in full text

Date
Authors
Publisher

InTech

Related search

On the Submodularity of Multi-Depot Traveling Salesman Games

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Dynamic Programming Approaches for the Traveling Salesman Problem With Drone

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2018English

The Traveling Salesman Problem With Precedence Constraints and Binary Costs

1996English

The Traveling Salesman Problem

English

Traveling Salesman Problem

2011English

Traveling Salesman Problem

English

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

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1980English

A Comparative Application Regarding the Effects of Traveling Salesman Problem on Logistics Costs

International Journal of Intelligent Systems and Applications in Engineering
2019English

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