Ye Yinyu

Yinyu Ye

Information about the author Yinyu Ye will soon be added to the site.
Found 48 papers in total
Hidden-City Ticketing: The Cause and Impact
Hidden-City Ticketing: The Cause and Impact
2016
Hidden‐city ticketing is an interesting airline ticket‐pricing...
An interior‐point path‐following algorithm for computing a Leontief economy equilibrium
An interior‐point path‐following algorithm for computing a Leontief economy equilibrium
2011
In this paper, we present an interior‐point path‐following algorithm for...
Geometric rounding: a dependent randomized rounding scheme
Geometric rounding: a dependent randomized rounding scheme
2011
We develop a new dependent randomized rounding method for approximation of a number of...
The Simplex and Policy‐Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
The Simplex and Policy‐Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
2011
We prove that the classic policy‐iteration method and the original simplex...
A Unified Framework for Dynamic Prediction Market Design
A Unified Framework for Dynamic Prediction Market Design
2011
Recently, coinciding with and perhaps driving the increased popularity of prediction...
Distributionally robust optimization under moment uncertainty with application to data-driven problems
Distributionally robust optimization under moment uncertainty with application to data-driven problems
2010
Stochastic programming can effectively describe many decision-making problems in...
An edge-reduction algorithm for the vertex cover problem
An edge-reduction algorithm for the vertex cover problem
2009
An approximation algorithm for the vertex cover problem is proposed with performance...
A Unified Theorem on SDP Rank Reduction
A Unified Theorem on SDP Rank Reduction
2008
We consider the problem of finding a low–rank approximate solution to a system...
Lot-sizing scheduling with batch setup times
Lot-sizing scheduling with batch setup times
2006
This paper is concerned with scheduling independent jobs on m parallel machines in...
A multiexchange local search algorithm for the capacitated facility location problem
A multiexchange local search algorithm for the capacitated facility location problem
2005
We present a multiexchange local search algorithm for approximating the capacitated...
A new complexity result on solving the Markov decision problem
A new complexity result on solving the Markov decision problem
2005
We present a new complexity result on solving the Markov decision problem (MDP) with n...
On the von Neumann economic growth problem
On the von Neumann economic growth problem
1995
We study the complexity of the von Neumann economic growth problem:...
On approximation of max-vertex-cover
On approximation of max-vertex-cover
2002
We consider the max-vertex-cover (MVC) problem, i.e., find k vertices from an...
A note on the maximization version of the multi-level facility location problem
A note on the maximization version of the multi-level facility location problem
2002
We show that the maximization version of the multi-level facility location problem can...
A computational study of the homogeneous algorithm for large-scale convex optimization
A computational study of the homogeneous algorithm for large-scale convex optimization
1998
Recently the authors have proposed a homogeneous and self-dual algorithm for solving...
On quadratic convergence of the O(√(n)L)-iteration homogeneous and self-dual linear programming algorithm
On quadratic convergence of the O(√(n)L)-iteration homogeneous and self-dual linear programming algorithm
1999
In this paper, we show that Ye–Todd–Mizuno's O(√(n)L) -iteration...
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
1998
In exact arithmetic, the simplex method applied to a particular linear programming...
On the complexity of approximating a Karush–Kuhn–Tucker point of quadratic programming
On the complexity of approximating a Karush–Kuhn–Tucker point of quadratic programming
1998
We present a potential reduction algorithm to approximate a...
Complexity analysis of the analytic center cutting plane method that uses multiple cuts
Complexity analysis of the analytic center cutting plane method that uses multiple cuts
1997
We analyze the complexity of the analytic center cutting plane or column generation...
Specially structured uncapacitated facility location problems
Specially structured uncapacitated facility location problems
1995
This paper considers a specially structured uncapacitated facility location problem....
Combining interior-point and pivoting algorithms for linear programming
Combining interior-point and pivoting algorithms for linear programming
1996
We propose a new approach to combine linear programming (LP) interior-point and...
An infeasible interior-point algorithm for solving primal and dual geometric programs
An infeasible interior-point algorithm for solving primal and dual geometric programs
1997
In this paper an algorithm is presented for solving the classical posynomial geometric...
A primal–dual interior point method whose running time depends only on the constraint matrix
A primal–dual interior point method whose running time depends only on the constraint matrix
1996
We propose a primal–dual ‘layered-step’ interior point (LIP)...
Improved complexity using higher-order correctors for primal–dual Dikin affine scaling
Improved complexity using higher-order correctors for primal–dual Dikin affine scaling
1997
In this paper we show that the primal–dual Dikin affine scaling algorithm for...
Papers per page: