Rising Star Talk by Sophie Huiberts on 'Why Can We Solve (Integer) Linear Programs?' at TCS Women 2021

Sophie Huiberts (CWI) will give a Rising Star Talk - 'Why Can We Solve (Integer) Linear Programs?' - at the TCS Women Spotlight Workshop of STOC2021 on 22 June 2021.
  • What Networks & Optimization Not a Seminar English
  • When 22-06-2021 from 15:00 to 18:00 (Europe/Amsterdam / UTC200)
  • Where Online
  • Web Visit external website
  • Add event to calendar iCal

Sophie Huiberts (CWI) will give a Rising Star Talk - 'Why Can We Solve (Integer) Linear Programs?' - at the TCS Women Spotlight Workshop of STOC2021 on 22 June 2021. Inspirational Talk by Prof. Cynthia Dwork (Harvard University) -  'Research. Results. Rejection. Redemption!'. Recommended!

 

From the TCS Women programme website:

The workshop will feature an inspirational talk by a senior researcher and short Rising Stars talks by senior graduate students and postdocs. The workshop registration is free of charge. All are welcome to attend.

  • Date: 22 June 2021
  • 9:00 am–11 am (EDT): Rising Stars Talks
  • 11 am–12:00 pm (EDT): Inspirational talk Prof. Cynthia Dwork (Title: Research. Results. Rejection. Redemption!)
  • Rising Stars Talks
    • Arpita Biswas (Title: Fair Allocation under Matroid Constraints)
    • Prerona Chatterjee (Title: Lower Bounds in Algebraic Circuit Complexity)
    • Omrit Filtser (Title: Proximity search in trajectory data under the Fréchet distance)
    • Sumegha Garg (Title: Tight Space Complexity of the Coin Problem)
    • Sophie Huiberts (Title: Why Can We Solve (Integer) Linear Programs?)
    • Sandra Kiefer (Title: Identifying Graphs by Playing with Pebbles: How Long Does It Take?)
    • Audra McMillan (Title: Hiding Among the Clones: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shuffling )

About CWI's Sophie Huiberts:

Sophie Huiberts (CWI)

Sophie Huiberts (CWI)

Title: Why Can We Solve (Integer) Linear Programs?

Abstract: The algorithms that are commonly used to solve (integer) linear programs work astoundingly well. From the theoretical perspective, the practical performance of these decades-old algorithms is relatively poorly understood. In this talk, I will explain some difficulties in obtaining rigorous explanations, and I will describe recent work to go beyond worst-case analysis for the simplex method for linear programming and the branch-and-bound algorithm for integer programming.

Bio: Sophie Huiberts is a final-year PhD candidate at Centrum Wiskunde & Informatica (CWI), where she is advised by Daniel Dadush. Her research interests are in practical algorithms, polyhedra, and combinatorial optimization.