Prospective Students   |   Current Students   |   Alumni   |   Industry & Government   |   Faculty Members
Username : Password : Forgot password?
  CSE6407:


Combinatorial Optimization

3 Credit Hour Course

Prerequisite:   None

Introduction to Optimization; Linear Programming: Different forms, Simplex Method, Primal-Dual theory; Max-Flow: The Max-Flow-Min-Cut Theorem, Ford-Fulkerson Labeling Algorithm, Dijkstra's Algorithm, The Floyd-Warshall Algorithm; Some Network Flow Algorithms: The Minimum Cost Network Flow Method, Transportation Problem; Capacitated Transportation Problem, Assignment Problem; Integer Linear Programming; Relaxation; Cutting-Plane Algorithm; Branch and Bound Technique; Dynamic Programming; NP-Completeness; TSP and Heuristics; Approximation.

Department of Computer Science and Engineering, ECE building, Palashi, Dhaka, Bangladesh. The Department is part of the Faculty of Electrical and Electronic Engineering at the Bangladesh University of Engineering & Technology. No part or content of this website may be copied or reproduced without permission of the department authority. Contact info@grad.cse.buet.ac.bd with questions or comments on this page.  [Development Credits]