CombOpt Reading Group
CombOpt Reading Group
About
Upcoming Talks
Recent Talks
Topics
Archive
Light
Dark
Automatic
Research Areas
Oct, 2023
Fast Combinatorial Algorithms for Efficient Sortation
by Madison Van Dyk
Oct 20, 2023 1:00 PM
MC6029 or Zoom
Abstract
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth, Part II
by Nikhil Kumar
Oct 13, 2023 1:00 PM
MC6029 or Zoom
Abstract
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth
by Nikhil Kumar
Oct 6, 2023 1:00 PM
MC6029 or Zoom
Abstract
Sep, 2023
A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints, Part II
by Noah Weninger
Sep 29, 2023 1:00 PM
MC6029 or Zoom
Abstract
A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints
by Noah Weninger
Sep 22, 2023 1:00 PM
MC6029 or Zoom
Abstract
Jul, 2023
Hardness of pricing routes for two-stage stochastic vehicle routing problems with scenarios, Part II
by Matheus Ota
Jul 31, 2023 1:00 PM
MC6029 or Zoom
Abstract
Hardness of pricing routes for two-stage stochastic vehicle routing problems with scenarios
by Matheus Ota
Jul 24, 2023 1:00 PM
MC6029 or Zoom
Abstract
Budget Feasible Mechanisms, Part II
by Rian Neogi
Jul 17, 2023 1:00 PM
MC6029 or Zoom
Abstract
Budget Feasible Mechanisms
by Rian Neogi
Jul 10, 2023 1:00 PM
MC6029 or Zoom
Abstract
Jun, 2023
A Primal-Dual Extension of the Goemans-Williamson Algorithm for the Weighted Fractional Cut Covering Problem, Part II
by Nathan Benedetto
Jun 26, 2023 1:00 PM
MC6029 or Zoom
Abstract
A Primal-Dual Extension of the Goemans-Williamson Algorithm for the Weighted Fractional Cut Covering Problem
by Nathan Benedetto
Jun 19, 2023 1:00 PM
MC6029 or Zoom
Abstract
Cite
×