I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Analyzing The Most Effective Algorithm For Knapsack Problem:
, In:
2023 3rd International Conference on Smart Cities, Automation & Intelligent Computing Systems (ICON-SONICS)
,
Boes, Devano Fernando
;
Dewanto, Kenrick Panca
;
Raushanfikir, Mahesa Insan
.. - p. 171-176 , 2023
Link:
https://doi.org/10.1109/ICON-SONICS59898.2023.10434966
RT T1 <cTitle>2023 3rd International Conference on Smart Cities, Automation & Intelligent Computing Systems (ICON-SONICS)</cTitle>: T1 <Title>Analyzing The Most Effective Algorithm For Knapsack Problems</Title> UL https://suche.suub.uni-bremen.de/peid=ieee-10434966&Exemplar=1&LAN=DE A1 Boes, Devano Fernando A1 Dewanto, Kenrick Panca A1 Raushanfikir, Mahesa Insan A1 Handoyo, Alif Tri A1 Nurhasanah YR 2023 K1 Visualization K1 Heuristic algorithms K1 Force K1 Programming K1 Dynamic programming K1 Time complexity K1 Python K1 Knapsack Problem K1 Brute Force K1 Greedy K1 Dynamic Programming K1 Branch and Bound SP 171 OP 176 LK http://dx.doi.org/https://doi.org/10.1109/ICON-SONICS59898.2023.10434966 DO https://doi.org/10.1109/ICON-SONICS59898.2023.10434966 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
