Branch and Bound Algorithm for Finding the Maximum Clique Problem

MS

Mochamad Suyudi Universitas Padjadjaran Bandung

Statistics and Empirical Research 2018

8th Annual International Conference on Industrial Engineering and Operations Management

Applications De Bruijn Graphs of Hamiltonian and Eulerian Cycles to Fault Tolerant Networks

MS

Mochamad Suyudi Universitas Padjadjaran Bandung

Statistics and Optimization 2016

6th Annual International Conference on Industrial Engineering and Operations Management

Graph Algorithm Vertex Coloring

MS

Mochamad Suyudi Universitas Padjadjaran Bandung

SS

Sukono Sukono Department of Mathemetics, Faculty of Mathematics and Natural Sciences, Universitas Padjadjaran

MM

Mustafa Mamat Universiti Sultan Zainal Abidin

AB

Abdul Talib Bon UNIVERSITI TUN HUSSEIN ONN MALAYSIA

Decision Sciences 2019

3rd European International Conference on Industrial Engineering and Operations Management

Solving Traveling Salesman Problems Using Branch and Bound Methods

MS

Mochamad Suyudi Universitas Padjadjaran Bandung

SS

Sukono Sukono Department of Mathemetics, Faculty of Mathematics and Natural Sciences, Universitas Padjadjaran

MM

Mustafa Mamat Universiti Sultan Zainal Abidin

AB

Abdul Talib Bon UNIVERSITI TUN HUSSEIN ONN MALAYSIA

Decision Sciences 2019

3rd European International Conference on Industrial Engineering and Operations Management

Signal Groups of Clique Compatible Graph in Traffic Control Problems

MS

Mochamad Suyudi Universitas Padjadjaran Bandung

Operations Management and Operations Research 2018

2nd European International Conference on Industrial Engineering and Operations Management

AN ENUMERATIVE ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM

SS

Sukono Sukono Department of Mathemetics, Faculty of Mathematics and Natural Sciences, Universitas Padjadjaran

MS

Mochamad Suyudi Universitas Padjadjaran Bandung

MM

Mustafa Mamat Universiti Sultan Zainal Abidin

AB

Abdul Talib Bon UNIVERSITI TUN HUSSEIN ONN MALAYSIA

Operations Research 2019

1st GCC International Conference on Industrial Engineering and Operations Management

Find The Maximum Clique by Graph Coloring Using Heuristic Greedy

SS

Sukono Sukono Department of Mathemetics, Faculty of Mathematics and Natural Sciences, Universitas Padjadjaran

MS

Mochamad Suyudi Universitas Padjadjaran Bandung

MM

Mustafa Mamat Universiti Sultan Zainal Abidin

AB

Abdul Talib Bon UNIVERSITI TUN HUSSEIN ONN MALAYSIA

Operations Research 2019

1st GCC International Conference on Industrial Engineering and Operations Management

An Efficient Approach for Traveling Salesman Problem Solution with Branch-and-Bound

MS

Mochamad Suyudi Universitas Padjadjaran Bandung

Operations Research 2016

2nd North American International Conference on Industrial Engineering and Operations Management