izpis_h1_title_alt

Problem polnjenja košev v povezavi z omejitvijo kardinalnosti : diplomsko delo
ID Remic, Maja (Author), ID Robič, Borut (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (1,04 MB)
MD5: 2D0A1D52A2296D8A547E8F2173A3DA50

Language:Slovenian
Keywords:aproksimacijski algoritmi, primerjava, FFD, RFF, Zhangov algoritem, računalništvo, univerzitetni študij, diplomske naloge
Work type:Undergraduate thesis
Typology:2.11 - Undergraduate Thesis
Organization:FRI - Faculty of Computer and Information Science
Place of publishing:Ljubljana
Publisher:M. Remic
Year:2011
Number of pages:43 str.
PID:20.500.12556/RUL-157042 This link opens in a new window
UDC:004(043.2)
COBISS.SI-ID:8451156 This link opens in a new window
Publication date in RUL:26.05.2024
Views:454
Downloads:23
Metadata:XML DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:Cardinality constrained bin packing
Keywords:approximation algorithms, comparison, FFD, RFF, Zhang's algorithm, computer science, diploma

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back