Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem

Kamran Azam, Muhammad

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Thesis

Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem

MPS-Authors

/persons/resource/persons44049

Kamran Azam, Muhammad
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Kamran Azam, M. (2005). Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem. Master Thesis, Universität des Saarlandes, Saarbrücken.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2601-9

Abstract

There is no abstract available