Yinyu Ye
Professor of Management Science and Engineering
and, by courtesy,
Electrical Engineering
Terman Engineering Center 316
Department of Management Science and
Engineering
School of Engineering
Stanford University
Phone: 650 723-7262
Fax: 650 723-1614
The new working paper: A Path to the
Arrow-Debreu Competitive Market Equilibrium is available. Click here for the
PDF file . (Posted
February/23/04, revised final version April 13, 2005; research supported by NSF
grant DMS-0306611.)
The new working
paper: An SDP based approach for anchor-free 3D graph realization is
available. Click here for the zipped PDF file
(Posted March 29/05).
The new
working paper: On Approximating Complex Quadratic Optimization Problems via
Semidefinite Programming Relaxations is available. Click here for the PDF file . (Posted 1/31/05; to
appear in IPCO 2005; research supported by NSF grant DMS-0306611.)
The new working paper: Market equilibria for
homothetic, quasi-concave utilities and economies of scale in production is
available. Click here for the PDF file . (Posted 10/18/04;
to appear in SODA 2005; research supported by NSF grant
DMS-0306611.)
The new working paper:
A Gradient Search Method to Round the Semidefinite Programming Relaxation
Solution for Ad Hoc Wireless Sensor Network Localization is available. Click
here for the PDF file
and Matlab demo code zip file . (Posted
August 24/04; Report updated 10/1/04 and Demo updated 10/10/04.)
The new working paper: Theory of Semidefinite
Programming for Sensor Network Localization is available. Click here for the
PDF file . (Posted
April/24/04 and updated 10/18/04; to appear in SODA 2005 and Mathematical
Programming.)
The new working paper:
A distributed method for solving semideinite programs arising from Ad Hoc
Wireless Sensor Network Localization is available. Click here for the PDF file . (Posted
October/30/03.)
The new working paper:
A Multi-Exchange Local Search Algorithm for the Capacitated Facility Location
Problem is available. Click here for the PDF file . (Posted
10/20/03, revised 3/3/04; to appear in Math of OR.)
The new revised working paper: Semidefinite
Programming for Ad Hoc Wireless Sensor Network Localization is available.
Click here for the PDF file
. (Posted 9/10/03 and updated 9/29/03, Revised February 2004; in IPSN
2004.)
The new revised working paper:
A New Complexity Result on Solving the Markov Decision Problem is
available. Click here for the PDF file. (Posted 10/4/02,
revised 10/3/04, research supported by NSF grant DMS-0306611, to appear in Math
of OR.)
The new working paper: An
improved algorithm for approximating the radii of point sets is available.
Click here for the Postscript
or PDF file. (Posted
4/3/03, Research supported in part by NSF grant DMS-0306611; in APPROX
2004.)
The new working paper: An
approximation algorithm for scheduling aircraft with holding time is
available. Click here for the Postscript file. (Posted
4/3/03, Research supported in part by NSF grant DMI-0231600, to appear in
CDC2004.)
The new working paper:
MILP formulation and polynomial time algorithm for aircraft scheduling
problems is available and to appear in CDC03. Click here for the Postscript file. (Posted
3/20/03, Research supported in part by NSF grant DMI-0231600, in
CDC2003.)
The new working paper:
Approximation Algorithms for Metric Facility Location Problems . Click
here for the postscript
file. This is the journal version of "Improved approximation algorithms for
metric facility location problems" of Proceedings of 5th International Workshop
on Approximation Algorithms for Combinatorial Optimization (APPROX 2002) and "A
2-approximation algorithm for the soft-capacitated facility location problem" of
Proceedings of 6th International Workshop on Approximation Algorithms for
Combinatorial Optimization (APPROX 2003). (Posted 12/10/02, and updated 10/7/03.
This author and Jiawei Zhang were supported in part by NSF grant
DMI-0231600.)
The new working paper:
Lot-sizing scheduling with batch setup times is available. Click here for
the Postscript file. (Posted
9/5/02. This work is supported by NSF grant DMI-0231600.)
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; to appear in Math Programming. This work is supported by NSF grant
DMS-9703490 and DMS-0306611.)
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
Click here for my NSF Reports
Here are Courses I am teaching
Photo collection of my Family
Yinyu Ye
Department of Management Science and
Engineering
School of Engineering
Stanford University
Stanford,
CA 94305
email:mailto:yinyu-ye@stanford.edu