Deakin home > Deakin University Library > Deakin Research Online > Polyhedral results and exact algorighms for the asymmetric travelling salesman problem with replenishment arcs

Polyhedral results and exact algorighms for the asymmetric travelling salesman problem with replenishment arcs

Mak, Vicky and Boland, Natashia 2005, Polyhedral results and exact algorighms for the asymmetric travelling salesman problem with replenishment arcs, Deakin University, School of Information Technology, Geelong, Vic..


Title Polyhedral results and exact algorighms for the asymmetric travelling salesman problem with replenishment arcs
Author(s) Mak, Vicky
Boland, Natashia
Publication date 2005
Series Technical reports. Mathematics series (Deakin University. School of Information Technology) ; TR M05/03
Publisher Deakin University, School of Information Technology
Place of publication Geelong, Vic.
Keyword(s) Traveling-salesman problem
Combinatorial optimization
Language eng
Field of Research 010206 Operations Research
HERDC Research category A6 Research report/technical paper
Copyright notice ©2005, Deakin University
Persistent URL http://hdl.handle.net/10536/DRO/DU:30010345

Document type: Report
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.

Versions
Version Filter Type
Access Statistics: 336 Abstract Views  -  Detailed Statistics
Created: Tue, 21 Oct 2008, 08:01:25 EST