A study on variants of assignment travelling salesman and network problems with exact and heuristic algorithms

Files

01_title page.pdf (34.57 KB)

02_prelimpages.pdf (53.64 KB)

03_contents.pdf (12.35 KB)

04_abstract.pdf (13.59 KB)

05_chapter 1.pdf (1.68 MB)

Abstract

newline

URI

http://hdl.handle.net/10603/467863

Collections

Department of Mathematics