Deakin home > Deakin University Library > Deakin Research Online > New cutting planes for the time and/or precedence constrained ATSP and directed VRP

New cutting planes for the time and/or precedence constrained ATSP and directed VRP

Mak, Vicky and Ernst, Andreas 2005, New cutting planes for the time and/or precedence constrained ATSP and directed VRP, Deakin University, School of Information Technology, Geelong, Vic..


Title New cutting planes for the time and/or precedence constrained ATSP and directed VRP
Alternative title New cutting-planes for the time and/or precedence constrained ATSP and directed VRP
Author(s) Mak, Vicky
Ernst, Andreas
Publication date 2005
Series Technical reports. Mathematics series (Deakin University. School of Information Technology) ; TR M05/04
Publisher Deakin University, School of Information Technology
Place of publication Geelong, Vic.
Keyword(s) Traveling-salesman problem
Integer programming
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:30010348

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: 370 Abstract Views  -  Detailed Statistics
Created: Tue, 21 Oct 2008, 08:01:27 EST