Yinyu Ye
Henry B. Tippie Research Professor
Computational Optimization Laboratory
S384 Pappajohn Building
Department of Management Sciences
College of Business Administration
The University of Iowa
Phone: 319 335-1947
Fax: 319 335-1956
The new working paper:
Improved complexity results on solving real-number linear feasibility
problems
is available. Click here for the Postscript file. (Posted 3/18/02. This work is supported by NSF grant DMS-9703490.)
The new working paper:
Approximate the 2-Catalog Segmentation Problem Using Semidefinite Programming Relaxations
is available. Click here for the Postscript file. (Posted 3/11/02. This work is supported by NSF grant DMI-9908077.)
The new working paper:
Improved Approximation Algorithms for Metric Facility Location Problems
(new version of A 1.52-Approximation Algorithm for the Uncapacitated Facility Location
Problem)
is available. Click here for the Postscript file. (Updated 4/18/02. This work is supported by NSF grant DMI-9908077.)
The short note:
Improved Analyses of Facility Location Algorithms
is available. Click here for the Postscript file. (Posted 11/5/01. This work is supported by NSF grant DMI-9908077.)
The new working paper:
On Solving Fewnomials Over Intervals in Fewnomial Time
is available. Click here for the
Postscript file. (Posted 8/22/01. This work is supported by DMS-9703490.)
The new working paper:
New results on quadratic minimization
is available. Click here for the
Postscript file. (Posted 5/30/01. This work is supported by
NSF grants DMI-9908077 and DMS-9703490.)
The new working paper:
On the Budgeted MAX-CUT problem and its Application to
the Capacitated Two-Parallel Machine Scheduling
is available. Click here for the
Postscript file. (Posted 3/16/01. This work is supported by
NSF grants DMI-9908077 and DMS-9703490.)
The new working paper:
DSDP3: Dual Scaling Algorithm for General Positive Semidefinite
Programming
is available. Click here for the
Postscript file. (Posted 3/16/01. This work is also supported by NSF grants DMI-9908077
and DMS-9703490.)
The new working paper:
An Approximation Algorithm for the Two-Parallel Machines Scheduling
Problem with Capacity Constraints
is available. Click here for the Postscript file. (This work is supported by
NSF grants DMI-9908077 and DMS-9703490.)
The new working paper:
Improved Approximation for Max Set Splitting and Max NAE SAT
is available. Click here for the Postscript file. (Revised 1/20/02. This work is supported by
NSF grants DMI-9908077 and DMS-9703490.)
The new working paper:
Solving Sparse Semidefinite Programs Using the Dual Scaling
Algorithm with an Iterative Solver
is available. Click here for the gzipped Postscript file. (This work is supported by
NSF grants DMI-9908077 and DMS-9703490.)
The BOOK Interior-Point Algorithm: Theory and Analysis has been published. Click here for information and related software .
Education
Ph.D. Engineering Economic Systems and Operations Research , Stanford University
, 1988.
M.S. Engineering Economic Systems , Stanford University
, 1983.
B.S. Systems and Control,
Huazhong University of Science and Technology , Wuhan, China, 1982.
Research Interest
Mathematical Programming
Optimization Algorithm Design and Analysis
Computational Complexity
Operations Research and Its Applications
My curriculum Vita is here
Click here for my NSF Reports
Here are Courses I am teaching
Photo collection of my Family
Yinyu Ye
Department of Management Sciences /
College of Business Administration /
The University of Iowa /
Iowa City, IA 52242
email: yinyu-ye@uiowa.edu /
(O) (319) 335-1947/ S384 PBAB/
FAX:(319) 335-1956/