Items where Author is "Suyudi, M."

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Jump to: Conference or Workshop Item
Number of items: 5.

Conference or Workshop Item

Suyudi, M. and Sukono, . and Mustafa, Mamat and Bon, A.T. (2019) Graph algorithm vertex coloring. In: 3rd Eu International Conference on Industrial Engineering and Operations Management,IEOM 2019, 23-26 July 2019, Park Hotel Congress Center PilsenPilsen; Czech Republic.

Mustafa, Mamat and Suyudi, M. and Sukono, . and Bon, A.T. (2019) Solving traveling salesman problems using branch and bound methods. In: 3rd Eu International Conference on Industrial Engineering and Operations Management,IEOM 2019, 23-26 July 2019, Park Hotel Congress Center PilsenPilsen; Czech Republic.

Mustafa, Mamat and Suyudi, M. and Sukono, . and Bon, A.T. (2019) An enumerative algorithm for the maximum clique problem. In: 1st GCC International Conference on Industrial Engineering and Operations Management, IEOM 2019, 26-28 November 2019, riyadh; Saudi Arabia.

Suyudi, M. and Sukono, . and Mamat, M. and Bon, A.T. (2018) Branch and bound algorithm for finding the maximum clique problem. In: 8th International Conference on Industrial Engineering and Operations Management, 01 Mac 2018, Bandung, Indonesia.

Mustafa, Mamat and Suyudi, M. and Sukono, . (2016) An efficient approach for traveling salesman problem solution with branch-and-bound. In: IEOM Detroit Conference, IEOM 2016, 23-25 Sep 2016, United States.

This list was generated on Tue Apr 16 22:37:58 2024 +08.
Welcome to UniSZA Institutional Repository (UniSZA-IR) is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.