Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/11376
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | BRAEKERS, Kris | - |
dc.contributor.author | JANSSENS, Gerrit K. | - |
dc.contributor.author | CARIS, An | - |
dc.date.accessioned | 2010-12-28T20:18:51Z | - |
dc.date.available | NO_RESTRICTION | - |
dc.date.available | 2010-12-28T20:18:51Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | Proceedings of the Industrial Simulation Conference 2010. p. 172-176. | - |
dc.identifier.isbn | 9789077381557 | - |
dc.identifier.uri | http://hdl.handle.net/1942/11376 | - |
dc.language.iso | en | - |
dc.title | A deterministic annealing algorithm for simultaneous routing of loaded and empty containers | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.conferencedate | 07/06/2010-09/06/2010 | - |
local.bibliographicCitation.conferencename | Industrial Simulation Conference 2010 | - |
dc.bibliographicCitation.conferencenr | 8 | - |
local.bibliographicCitation.conferenceplace | Budapest, Hungary | - |
dc.identifier.epage | 176 | - |
dc.identifier.spage | 172 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
dc.bibliographicCitation.oldjcat | C2 | - |
dc.identifier.isi | 000396178800027 | - |
local.bibliographicCitation.btitle | Proceedings of the Industrial Simulation Conference 2010 | - |
item.validation | ecoom 2019 | - |
item.contributor | BRAEKERS, Kris | - |
item.contributor | JANSSENS, Gerrit K. | - |
item.contributor | CARIS, An | - |
item.fullcitation | BRAEKERS, Kris; JANSSENS, Gerrit K. & CARIS, An (2010) A deterministic annealing algorithm for simultaneous routing of loaded and empty containers. In: Proceedings of the Industrial Simulation Conference 2010. p. 172-176.. | - |
item.fulltext | No Fulltext | - |
item.accessRights | Closed Access | - |
Appears in Collections: | Research publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.