• Home
• Library
• DRO home

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   Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved. Versions Version Filter Type Tue, 21 Oct 2008, 08:01:27 EST Fri, 12 Jun 2009, 15:19:14 EST Fri, 12 Jun 2009, 15:20:51 EST Fri, 12 Jun 2009, 15:29:40 EST Fri, 12 Jun 2009, 15:32:02 EST Fri, 12 Jun 2009, 15:33:17 EST Fri, 12 Jun 2009, 15:37:06 EST Mon, 29 Jun 2009, 13:07:07 EST Fri, 11 Jun 2010, 14:55:49 EST Mon, 16 Jul 2012, 14:21:48 EST Mon, 16 Jul 2012, 14:22:47 EST Fri, 27 Jul 2012, 13:12:52 EST Wed, 01 Aug 2012, 08:41:23 EST Filtered Full Access Statistics: 383 Abstract Views  -  Detailed Statistics Created: Tue, 21 Oct 2008, 08:01:27 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.