Synchronized Traveling Salesman Problem (Q5084688)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7549445

Language	Label	Description	Also known as
English	Synchronized Traveling Salesman Problem	scientific article; zbMATH DE number 7549445

Statements

scholarly article

0 references

Synchronized Traveling Salesman Problem (English)

0 references

0 references

József Varnyú

0 references

Journal of Graph Algorithms and Applications

0 references

publication date

28 June 2022

0 references

full work available at URL

https://arxiv.org/abs/2012.00311

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

The prize collecting traveling salesman problem

0 references

The dynamic transportation problem: A survey

0 references

Finding 2-Factors Closer to TSP Tours in Cubic Graphs

0 references

Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations

0 references

Constructing Maximal Dynamic Flows from Static Flows

0 references

The Quickest Transshipment Problem

0 references

A Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm

0 references

A Cutting Planes Algorithm for the m-Salesmen Problem

0 references

Pebble game algorithms and sparse graphs

0 references

An Introduction to Network Flows over Time

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.7155/JGAA.00566

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5084688

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5084688&oldid=39526940"