Etcheverry Hall
University of California
Berkeley, CA 94720
TEL: (510) 642-4998
dhochbaum at berkeley.edu
I try to be an optimizer in whatever I do, and my research interests reflect that. Some problem applications I am interested in include:
Khachian Prize, yeyyy.
A new, very efficient, breakpoints algorithm for the quadratic Knapsack problem, based on the parametric HPF procedure. The code and a collection of datasets are available to download. See, Dorit S. Hochbaum, Philipp Baumann, Olivier Goldschmidt, Yiqing Zhang. A Fast and Effective Breakpoints Algorithm for the Quadratic Knapsack Problem. arXiv:2408.12183 [math.OC] Aug 2024.
UC Berkeley, along with Georgia Tech, USC and other universities, was awarded $20M for the NSF National AI Institute for Advances in Optimization, 2021-2026. I serve as co-PI on this award.
As for older news:
A new maximum diversity algorithm IEOR News.
The neuron segmentation algorithm HNCcorr is one of the leading algorithms in the Neurofinder benchmark for cell identification in calcium imaging movies. The algorithm is HNC (Hochbaum Normalized Cut), aka NC', with similarities based on distances in correlation space. This is joint work with Quico Spaen and Roberto Asin.
Software for algorithms used and developed in my research group.
An archive of no-longer-active past algorithms with Java interfaces is included in our RIOT Project site. The algorithm for the baseball elimination problem based on the paper
Ilan Adler, Alan Erera, Dorit S. Hochbaum and Eli Olinick. "Baseball, Optimization and the World Wide Web". Interfaces 32:2 March-April 2002, pp. 12-22,
is included here.
Topics in nonlinear complexity and combinatorial optimization: IEOR 290G, Spring 2017 -
in Lecture notes Spring 2017.Network Flows and Graph Algorithms: IEOR 266, Updated Spring 2024 -
in Lecture notes Spring 2024.Integer Programming and Combinatorial Optimization: IEOR 269 -
in Lecture notes Spring 2010.
