Search Results - Suyudi M.
- Showing 1 - 6 results of 6
-
1
Branch and bound algorithm for finding the maximum clique problem by Suyudi, M., Sukono, ., Mamat, M., Bon, A.T.
Published 2018Get full text
Get full text
Conference or Workshop Item -
2
An efficient approach for traveling salesman problem solution with branch-and-bound by Mustafa, Mamat, Suyudi, M., Sukono, .
Published 2016Get full text
Get full text
Conference or Workshop Item -
3
An enumerative algorithm for the maximum clique problem by Mustafa, Mamat, Suyudi, M., Sukono, ., Bon, A.T.
Published 2019Get full text
Get full text
Conference or Workshop Item -
4
Graph algorithm vertex coloring by Suyudi, M., Sukono, ., Mustafa, Mamat, Bon, A.T.
Published 2019Get full text
Get full text
Conference or Workshop Item -
5
Solving traveling salesman problems using branch and bound methods by Mustafa, Mamat, Suyudi, M., Sukono, ., Bon, A.T.
Published 2019Get full text
Get full text
Conference or Workshop Item -
6
Optimization of the mean-variance investment portfolio of some stocks under market sentiment and the ARMAX-GARCH model by Hasbullah E.S., Sukono, Rusyaman E., Suyudi M., Kalfin, Halim N.B.A.
Published 2024Get full text
journal::journal article
