Welcome to my site. The recent news:
My paper Polynomial time algorithms for ratio regions and a variant of normalized cut, is the winner of the ICS2011 computing prize (awarded at INFORMS NC Nov 15, 2011). In related news, I got a new NSF award on "Novel efficient clustering techniques for data mining, ranking, pattern recognition and segmentation of large scale data sets."
I also have substantial interest in algorithms that solve problems as efficiently as possible and exploring complexity issues. These include approximation algorithms, strongly polynomial algorithms, practical integer programming algorithms for discrete optimization problems, problems on graphs, and nonlinear problems.
In the applications area I am most interested in supply chain applications. I am the founder and director of the UC Berkeley Supply Chain Initiative that serves to focus research activity and collaboration with industry for faculty and students with expertise in this area.
Some of my research on algorithms and applications can now be accessed and viewed via an on-line library of algorithms with Java interfaces. These include an easy to use graphical interface for small size problems and assessment of capabilities of existing software for large size problems. There is a short summary for each algorithm describing its uses, capabilities and access information. The collection is included in our site. In the future there will be additional demonstrations of software developed in-house and elsewhere with informative output. The algorithms provided are for problems listed below where those that are ready to view are linked to the page sites. Others are in the `pipeline'.
· Network Flows and Graph Algorithms: IEOR 266, updated fall 2012 -
· Integer Programming and Combinatorial Optimization: IEOR 269 -
You are the visitor since 4/16/1996
hochbaum at ieor.berkeley.edu
Dorit S. Hochbaum
Last Modified On: 7/29/2013