IEOM Index

Advanced Search

Mochamad Suyudi

Affiliation

Universitas Padjadjaran Bandung

Showing 1 - 8 of 8

Branch and Bound Algorithm for Finding the Maximum Clique Problem

Mochamad Suyudi

8th Annual International Conference on Industrial Engineering and Operations Management

Publication Year: 2018

Abstract PDF

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

Mochamad Suyudi

6th Annual International Conference on Industrial Engineering and Operations Management

Publication Year: 2016

Abstract PDF

Graph Algorithm Vertex Coloring

Mochamad Suyudi; Sukono Sukono; Mustafa Mamat & Abdul Talib Bon

3rd European International Conference on Industrial Engineering and Operations Management

Publication Year: 2019

Abstract PDF

Solving Traveling Salesman Problems Using Branch and Bound Methods

Mochamad Suyudi; Sukono Sukono; Mustafa Mamat & Abdul Talib Bon

3rd European International Conference on Industrial Engineering and Operations Management

Publication Year: 2019

Abstract PDF

Signal Groups of Clique Compatible Graph in Traffic Control Problems

Mochamad Suyudi

2nd European International Conference on Industrial Engineering and Operations Management

Publication Year: 2018

Abstract PDF

AN ENUMERATIVE ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM

Sukono Sukono; Mochamad Suyudi; Mustafa Mamat & Abdul Talib Bon

1st GCC International Conference on Industrial Engineering and Operations Management

Publication Year: 2019

Abstract PDF

Find The Maximum Clique by Graph Coloring Using Heuristic Greedy

Sukono Sukono; Mochamad Suyudi; Mustafa Mamat & Abdul Talib Bon

1st GCC International Conference on Industrial Engineering and Operations Management

Publication Year: 2019

Abstract PDF

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

Mochamad Suyudi

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

Publication Year: 2016

Abstract PDF