PENGGUNAAN METODE CUTTING PLANE UNTUK MENYELESAIKAN MINIMUM SPANNING TREE DENGAN KENDALA BOBOT PADA GRAF K_n
This study aims to determine the minimum spanning tree of a complete graph K_n with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method. This algorithm works by reducing the solution area so that it becomes...
Sparad:
| Huvudskapare: | , |
|---|---|
| Materialtyp: | Bok |
| Publicerad: |
Universitas Muhammadiyah Metro,
2018-06-01T00:00:00Z.
|
| Ämnen: | |
| Länkar: | Connect to this object online. |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|
Internet
Connect to this object online.3rd Floor Main Library
| Signum: |
A1234.567 |
|---|---|
| Exemplar 1 | Tillgänglig |