Skip to content
Advanced
Advanced
  • Search
  • Optimasi masalah knapsack meng...
  • Holdings
  • Cite this
  • Text this
  • Email this
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
Cover Image

Optimasi masalah knapsack menggunakan algoritma branch and bound

oen, 1/ws.c.1

Main Author: Fitriatul Malaikhah
Format: Skripsi
Language: Indonesia
Published: Fak. Sains dan Teknologi UIN Sunan Kalijaga 2016
Subjects:
ALGORITMA - TERAPAN
PINJAM
  • Holdings
  • Description
  • Similar Items
  • Staff View

Similar Items

  • Aplikasi algoritma branch and bound untuk optimasi jalur pemadam kebakaran Kota Yogyakarta
    by: Sri Margiyani
    Published: (2014)
  • Implementasi algoritma branch and bound untuk optimasi rute pengangkutan sampah Kota Yogyakarta
    by: M Shofi Alkhoiroda'i
    Published: (2013)
  • Optimasi produksi dengan menggunakan metode fuzzy integer linear programming (branch and bound) (studi kasus pabrik roti bangkit)
    by: Prayudo Dwi Pangestu
    Published: (2017)
  • Algoritma lexisearch menggunakan representasi adjacency dan path untuk menyelesaikan bottleneck traveling salesman problem
    by: Siti Bahjatun Saniyah
    Published: (2018)
  • Optimasi vehicle routing problem with multipe trips intermediate facility (vrpmtif) menggunakan metode nearest neighbour (nn) dan A* (studi kasus: pengangkutan sampah di Klaten)
    by: Ade Novianti Hidayah
    Published: (2018)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs
Loading...