Skip navigation
Skip navigation

Flexible routing combing Constraint Programming, Large Neighbourhood Search, and Feature-based Insertion

dc.contributor.authorKilby, Philip
dc.contributor.authorVerden, Andrew
dc.contributor.editorKerstin Schill
dc.coverage.spatialBarcelona Spain
dc.date.accessioned2015-12-10T22:14:22Z
dc.date.createdJuly 16 2011
dc.identifier.urihttp://hdl.handle.net/1885/50263
dc.relation.ispartofseriesArtificial Intelligence and Logistics (AILog 2011)
dc.sourceFlexible routing combing Constraint Programming, Large Neighbourhood Search, and Feature-based Insertion
dc.titleFlexible routing combing Constraint Programming, Large Neighbourhood Search, and Feature-based Insertion
dc.typeConference paper
local.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2011
local.identifier.absfor080399 - Computer Software not elsewhere classified
local.identifier.ariespublicationu4963866xPUB200
local.type.statusPublished Version
local.contributor.affiliationKilby, Philip, College of Engineering and Computer Science, ANU
local.contributor.affiliationVerden, Andrew, NICTA
local.description.embargo2037-12-31
local.bibliographicCitation.startpage1
local.bibliographicCitation.lastpage6
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
dc.date.updated2021-08-01T08:38:43Z
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Kilby_Flexible_routing_combing_2011.pdf119.97 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator