Dorit S. Hochbaum, Professor

Industrial Engineering and
Operations Research

Etcheverry Hall
University of California
Berkeley, CA 94720
TEL: (510) 642-4998
FAX: (510) 642-1403

hochbaum at ieor.berkeley.edu

[ Bio | Research Interests | HPF-Pseudoflow Algorithm | Research on the Web | List of Writings | Lecture Notes | PhD Students | Supply Chain Activities ]

Welcome to my site.

Recent News:

I was selected as a Fellow of the Society for Industrial and Applied Mathematics List of SIAM Fellows 2014 and citations. "SIAM Fellows are nominated by peers for their distinguished contributions to the fields of applied mathematics and computational science and related disciplines. They will be recognized at the 2014 SIAM Annual Meeting to be held in Chicago in July."

As for less 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). And I was awarded an NSF award on "Novel efficient clustering techniques for data mining, ranking, pattern recognition and segmentation of large scale data sets."

I try to be an optimizer in whatever I do, and my research interests reflect that. Some problem applications I am interested in include:

  • Data mining and pattern recognition with flow techniques
  • Image segmentation and detecting hidden features in medical images
  • Detecting security threats - domestic nuclear threat detection The DoNuTS project
  • Information technology issues in supply chain management
  • Manufacturing of VLSI circuit
  • Testing and designing circuits
  • Scheduling problems
  • Planning of mining operations
  • Locations of facilities
  • Distribution and logistics
  • And, baking cakes optimally.

Please consult the list of publications or technical reports for specific titles.

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 RIOT Project 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'.

Statistics course of P. Stark

2-dimesional linear programming


·                                 Listing of Technical Reports

·                                 A book on Approximation algorithms


·                                 Network Flows and Graph Algorithms: IEOR 266, updated spring 2014 -

in pdf

·                                 Integer Programming and Combinatorial Optimization: IEOR 269 -

in Lecture notes Spring 2010.

·                                 U of Copenhagen honorary doctorate trip report: -

in powerpoint



You are the visitor since 4/16/1996

hochbaum at ieor.berkeley.edu

Dorit S. Hochbaum

Last Modified On: 4/10/2014
-dsh-