Please use this identifier to cite or link to this item: https://hdl.handle.net/10216/110172
Full metadata record
DC FieldValueLanguage
dc.creatorFilipe Daniel Alves Brandão
dc.date.accessioned2019-02-08T11:13:44Z-
dc.date.available2019-02-08T11:13:44Z-
dc.date.issued2017-09-22
dc.date.submitted2018-01-17
dc.identifier.othersigarra:243363
dc.identifier.urihttps://repositorio-aberto.up.pt/handle/10216/110172-
dc.language.isoeng
dc.rightsopenAccess
dc.subjectCiências da computação e da informação
dc.subjectComputer and information sciences
dc.titleCutting & Packing Problems: General Arc-flow Formulation with Graph Compression
dc.typeTese
dc.contributor.uportoFaculdade de Ciências
dc.identifier.tid101452551
dc.subject.fosCiências exactas e naturais::Ciências da computação e da informação
dc.subject.fosNatural sciences::Computer and information sciences
thesis.degree.disciplineDoutoramento em Ciência de Computadores
thesis.degree.grantorFaculdade de Ciências
thesis.degree.grantorUniversidade do Porto
thesis.degree.level2
Appears in Collections:FCUP - Tese

Files in This Item:
File Description SizeFormat 
243363.pdfCutting & Packing Problems: General Arc-flow Formulation with Graph Compression874.88 kBAdobe PDFThumbnail
View/Open


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