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	Haas School of Business F565 Haas University of California Berkeley, CA 94720 hochbaum at haas.berkeley.edu
	dorit at hochbaum.ieor.berkeley.edu

Welcome to my site. In case you were wondering, yes, I am on the faculty of both Haas school of Business and the department of IE&OR in the College of Engineering - 50% in each. And yes, my loyalties are also equally divided: 99% to Haas and 99% to Engineering. The entire rest is devoted to my family and friends.

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
• Robots motion problems
• 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 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'.

• Minimum/Maximum Cut
• Graph algorithms Travelling salesman, spanning trees and more.
• Edge Connectivity
• Convex Hull
• Clustering
• Baseball elimination and clinching
• Basketball elimination and clinching .
• Vehicle Routing
• Maximum Flow
• Open-Pit Mining
• Scheduling Problems
• Linear Programming
• Financial Portfolio Optimization
• A New Algorithms for the Maximum Flow Problem, Parametric flow and Bipartite Matching - The Pseudoflow Algorithm
• The R.I.O.T. Site

  

  Statistics course of P. Stark

  2-dimesional linear programming

  ---

  

  Listing of Publications

  Listing of Technical Reports

  A book on Approximation algorithms

  ---

  

  Network Flows and Graph Algorithms: IEOR 266, updated Fall 2005 -

  in postscript

  Integer Programming and Combinatorial Optimization: IEOR 269 -

  in Postscript

  U of Copenhagen honorary doctorate trip report: -

  in powerpoint

  ---

  

  Past	Present

  ---

  You are the visitor since 4/16/1996

  hochbaum at ieor.berkeley.edu

  Dorit S. Hochbaum

  Last Modified On: 8/30/2007
  -dsh-