On single courier problem (Q941049): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Revision as of 15:07, 28 June 2024

scientific article

Language	Label	Description	Also known as
English	On single courier problem	scientific article

Statements

scholarly article

0 references

On single courier problem (English)

0 references

Malay Bhattacharyya

0 references

Anup Kumar Bandyopadhyay

0 references

Optimization Letters

0 references

publication date

4 September 2008

0 references

zbMATH Keywords

courier problems

0 references

single courier problem

0 references

traveling salesman problem

0 references

optimality principle

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11590-008-0079-4

0 references

0 references

Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem

0 references

The Traveling Salesman Problem: A Survey

0 references

The traveling-salesman problem and minimum spanning trees: Part II

0 references

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

0 references

Approximation schemes for NP-hard geometric optimization problems: a survey

0 references

Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice

0 references

Discrete optimization in public rail transport

0 references

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s11590-008-0079-4

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:941049

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