Registered Data

[02102] Network Construction Problems

  • Session Time & Room : 3C (Aug.23, 13:20-15:00) @A206
  • Type : Contributed Talk
  • Abstract : Network construction problems seek to find efficient schedules of constructing edges of a new transportation network under limited resources, with the goal of minimizing a scheduling objective which is a non-decreasing function of the times when some important pairs of nodes become connected. The talk will discuss some recent results in this area of combinatorial optimization, focusing on classification and computational complexity.
  • Classification : 90C27
  • Format : Talk at Waseda University
  • Author(s) :
    • Igor Averbakh (University of Toronto)