| Publication | Date of Publication | Type |
|---|
An update-and-stabilize framework for the minimum-norm-point problem
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
| An improved approximation algorithm for the covering 0-1 integer program | 2021-02-19 | Paper |
An approximation algorithm for the partial covering 0-1 integer program
Discrete Applied Mathematics | 2020-02-20 | Paper |
Steepest-edge rule and its number of simplex iterations for a nondegenerate LP
Operations Research Letters | 2020-02-10 | Paper |
Approximation algorithms for the covering-type \(k\)-violation linear program
Optimization Letters | 2019-10-18 | Paper |
An extension of Chubanov's algorithm to symmetric cones
Mathematical Programming. Series A. Series B | 2019-02-07 | Paper |
A simple projection algorithm for linear programming problems
Algorithmica | 2019-01-11 | Paper |
A refinement of Todd's bound for the diameter of a polyhedron
Operations Research Letters | 2018-09-28 | Paper |
| An oracle-based projection and rescaling algorithm for linear semi-infinite feasibility problems and its application to SDP and SOCP | 2018-09-27 | Paper |
| A generalization of the steepest-edge rule and its number of simplex iterations for a nondegenerate LP | 2018-03-14 | Paper |
On the number of solutions generated by the simplex method for LP
Springer Proceedings in Mathematics & Statistics | 2015-10-06 | Paper |
The LP-Newton method for standard form linear programming problems
Operations Research Letters | 2014-05-15 | Paper |
A simple variant of the Mizuno-Todd-Ye predictor-corrector algorithm and its objective-function-free complexity
SIAM Journal on Optimization | 2013-12-13 | Paper |
An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables
Asia-Pacific Journal of Operational Research | 2013-09-05 | Paper |
A bound for the number of different basic solutions generated by the simplex method
Mathematical Programming. Series A. Series B | 2013-03-18 | Paper |
| On the number of solutions generated by Dantzig's simplex method for LP with bounded variables | 2013-02-07 | Paper |
Lower bounds for the maximum number of solutions generated by the simplex method
Journal of the Operations Research Society of Japan | 2012-12-08 | Paper |
On the number of solutions generated by the dual simplex method
Operations Research Letters | 2012-08-17 | Paper |
Klee-Minty's LP and upper bounds for Dantzig's simplex method
Operations Research Letters | 2011-08-09 | Paper |
Proximity of weighted and layered least squares solutions
SIAM Journal on Matrix Analysis and Applications | 2010-08-19 | Paper |
QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS
Journal of the Operations Research Society of Japan | 2008-11-10 | Paper |
AN EXTENSION OF A MINIMAX APPROACH TO MULTIPLE CLASSIFICATION
Journal of the Operations Research Society of Japan | 2008-04-29 | Paper |
AN EXTENSION OF A MINIMAX APPROACH TO MULTIPLE CLASSIFICATION
Journal of the Operations Research Society of Japan | 2008-02-05 | Paper |
