Dorit S. Hochbaum, Professor
|
|
Industrial
Engineering and |
[ Bio | Research Interests | HPF-Pseudoflow Algorithm | Research on the Web | List of Writings | Lecture Notes | PhD Students | Supply Chain Activities ]
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 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'.
- HPF Hochbaum's PseudoFlow algorithm - an implementation
- Parametric HPF - an implementation
- single or multi-frame image segmentation with the flow algorithm HPF as subroutine.
- An efficient algorithm for co-segmentation with the flow algorithm HPF as subroutine.
- 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
- The R.I.O.T. Site
2-dimesional linear programming
· Listing of Technical Reports
·
A
book on Approximation algorithms
·
Network Flows and Graph
Algorithms: IEOR 266, updated fall 2012 -
in
pdf
·
Integer Programming and
Combinatorial Optimization: IEOR 269 -
·
U of
in
powerpoint
You are the visitor
since 4/16/1996
hochbaum
at ieor.berkeley.edu
Dorit S. Hochbaum
Last Modified On: 12/6/2012
-dsh-