Login
IEOM Index
Forefront of Scientific Publications
Home
Conferences
Upcoming Conferences
IEOM Society Home
Advanced
Menu
IEOM Index
Home
Conferences
Upcoming Conferences
IEOM Society Home
Home
Conferences
8th Annual International Conference on Industrial Engineering and Operations Management
Branch and Bound Algorithm for Finding the Maximum Clique Problem
Statistics and Empirical Research
Branch and Bound Algorithm for Finding the Maximum Clique Problem
42 views
3 Downloads
MS
Mochamad Suyudi
Universitas Padjadjaran Bandung
Download PDF
Cite This
Description
Published in
8th Annual International Conference on Industrial Engineering and Operations Management, Bandung, Indonesia
Publisher
IEOM Society International
Date of Conferences
March 6–8, 2018
ISBN
978-1-5323-5944-6
ISSN/E-ISSN
2169-8767
Cite