Algorithms, Combinatorics, and Optimization Seminar

  • Remote Access Enabled - Zoom
  • Virtual Presentation
  • University Professor
  • Department of Mathematical Sciences
  • Carnegie Mellon University

Expected values in combinatorial optimization

We consider some classical problems in Combinatorial Optimization when the weights/costs are random variables. We consider them from the point of view of their expected optimum value and from their algorithmic solvability. Our aim is to cover a lot of ground and to motivate the many open problems.

About the Speaker.

Zoom Participation. See announcement.

For More Information, Please Contact: