Seminar: Optimization via Branch Decomposition

Event Details
  • Date/Time:
    • Thursday September 27, 2001
      11:00 am - 12:00 am
  • Location: Instructional Center room 209
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
Barbara Christopher
Industrial and Systems Engineering
Contact Barbara Christopher
404.385.3102
Summaries

Summary Sentence: Seminar: Optimization via Branch Decomposition

Full Summary: Seminar: Optimization via Branch Decomposition

Robertson and Seymour introduced branch-width as a new measure of the connectivity of graphs. Decompositions based on this measure provide a natural framework for implementing dynamic programming algorithms to solve graph optimization problems. In this talk we will discuss the computational
issues involved in using branch-width as as a general tool in discreteoptimization. We will present applications to traveling salesman problems, euclidean steiner tree problems, graph bipartition, maximum cut problems, maximum stable set problems, and network design problems.

Additional Information

In Campus Calendar
No
Groups

H. Milton Stewart School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
No keywords were submitted.
Status
  • Created By: Barbara Christopher
  • Workflow Status: Published
  • Created On: Oct 8, 2010 - 7:43am
  • Last Updated: Oct 7, 2016 - 9:53pm