The Magic Of Monotone Integer Programs: Polynomial Time Solvability With Min-Cut Procedure, Fast High Quality Solutions for Related Hard Problems and the New Incremental Parametric Cut Algorithm For Densest Subgraph and Other Monotone Ratio Problems
Dorit Hochbaum, University of California, Berkeley
Thursday, December 12, 2024
4:30 pm
Sherrerd Hall, 101
Princeton Optimization Seminar
See event website for additional details and how to view or participate.
Sponsors
Operations Research and Financial Engineering
Developing mathematical and computational tools for making decisions under uncertainty
