| Publication | Date of Publication | Type |
|---|
A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion
(available as arXiv preprint) | 2023-01-31 | Paper |
Dynamic pricing and inventory management of a dual-channel supply chain under different power structures
European Journal of Operational Research | 2022-06-10 | Paper |
A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource
Journal of Scheduling | 2021-12-13 | Paper |
| An improved approximation algorithm for the covering 0-1 integer program | 2021-02-19 | Paper |
A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
Optimization Letters | 2021-02-17 | Paper |
An approximation algorithm for the partial covering 0-1 integer program
Discrete Applied Mathematics | 2020-02-20 | Paper |
Approximation algorithms for the covering-type \(k\)-violation linear program
Optimization Letters | 2019-10-18 | Paper |
| A mixed integer programming approach for the minimum maximal flow | 2019-01-10 | Paper |
A primal-simplex based Tardos' algorithm
Operations Research Letters | 2018-09-28 | Paper |
| scientific article; zbMATH DE number 6938247 (Why is no real title available?) | 2018-09-17 | Paper |
| On a reduction of the weighted induced bipartite subgraph problem to the weighted independent set problem | 2018-07-25 | Paper |
Small degenerate simplices can be bad for simplex methods
Journal of the Operations Research Society of Japan | 2018-03-29 | Paper |
Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry
Journal of Industrial and Management Optimization | 2017-06-15 | Paper |
A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH
Journal of the Operations Research Society of Japan | 2017-06-13 | Paper |
The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption
Optimization Methods & Software | 2016-11-08 | Paper |
| A simple proof of tail--polynomial bounds on the diameter of polyhedra | 2016-04-14 | Paper |
On the number of solutions generated by the simplex method for LP
Springer Proceedings in Mathematics & Statistics | 2015-10-06 | Paper |
Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs
Computational Management Science | 2015-07-21 | Paper |
The LP-Newton method for standard form linear programming problems
Operations Research Letters | 2014-05-15 | Paper |
Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks
Operations Research Letters | 2014-05-15 | 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 |
On the generalized mirrored scheme for double round robin tournaments in sports scheduling
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 separation in 2-period double round robin tournaments with minimum breaks
Computers & Operations Research | 2012-11-15 | 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 |
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 |
| scientific article; zbMATH DE number 2190128 (Why is no real title available?) | 2005-08-01 | Paper |
High order infeasible-interior-point methods for solving sufficient linear complementarity problems
Mathematics of Operations Research | 2001-11-26 | Paper |
Convergence of a class of inexact interior-point algorithms for linear programs
Mathematics of Operations Research | 2001-11-26 | Paper |
On two homogeneous self-dual approaches to linear programming and its extensions.
Mathematical Programming. Series A. Series B | 2001-10-03 | Paper |
| scientific article; zbMATH DE number 1489809 (Why is no real title available?) | 2001-02-22 | Paper |
| scientific article; zbMATH DE number 1304158 (Why is no real title available?) | 2000-10-25 | Paper |
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.
Mathematical Programming. Series A. Series B | 2000-07-21 | Paper |
| scientific article; zbMATH DE number 1380759 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1379524 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1322430 (Why is no real title available?) | 1999-08-09 | Paper |
A modified layered-step interior-point algorithm for linear programming
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
A conjugate direction method for approximating the analytic center of a polytope
Journal of Inequalities and Applications | 1998-10-15 | Paper |
| scientific article; zbMATH DE number 1047678 (Why is no real title available?) | 1997-08-11 | Paper |
A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
Mathematics of Operations Research | 1997-03-11 | Paper |
A linear programming instance with many crossover events
Journal of Complexity | 1997-02-04 | Paper |
An infeasible-interior-point algorithm using projections onto a convex set
Annals of Operations Research | 1996-07-01 | Paper |
A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
Applied Mathematics and Optimization | 1996-06-02 | Paper |
A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
Mathematics of Operations Research | 1995-07-31 | Paper |
Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
SIAM Journal on Optimization | 1995-05-30 | Paper |
A predictor-corrector infeasible-interior-point algorithm for linear programming
Operations Research Letters | 1995-01-11 | Paper |
Polynomiality of infeasible-interior-point algorithms for linear programming
Mathematical Programming. Series A. Series B | 1994-12-11 | Paper |
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
Mathematics of Operations Research | 1994-11-17 | Paper |
Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms
SIAM Journal on Optimization | 1994-10-04 | Paper |
A little theorem of the big \({\mathcal M}\) in interior point algorithms
Mathematical Programming. Series A. Series B | 1994-08-16 | Paper |
A primal-dual affine-scaling potential-reduction algorithm for linear programming
Mathematical Programming. Series A. Series B | 1994-04-28 | Paper |
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
Mathematics of Operations Research | 1994-04-12 | Paper |
A General Framework of Continuation Methods for Complementarity Problems
Mathematics of Operations Research | 1994-04-12 | Paper |
A primal-dual infeasible-interior-point algorithm for linear programming
Mathematical Programming. Series A. Series B | 1994-03-10 | Paper |
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
Mathematical Programming. Series A. Series B | 1993-08-30 | Paper |
Determination of optimal vertices from feasible solutions in unimodular linear programming
Mathematical Programming. Series A. Series B | 1993-08-30 | Paper |
Large-Step Interior Point Algorithms for Linear Complementarity Problems
SIAM Journal on Optimization | 1993-08-11 | Paper |
A new polynomial time method for a linear complementarity problem
Mathematical Programming. Series A. Series B | 1993-04-01 | Paper |
Strict monotonicity in Todd's low-complexity algorithm for linear programming
Operations Research Letters | 1993-01-16 | Paper |
An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
Mathematical Programming. Series A. Series B | 1992-06-27 | Paper |
An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
Linear Algebra and its Applications | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4185392 (Why is no real title available?) | 1990-01-01 | Paper |
Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
Mathematics of Operations Research | 1990-01-01 | Paper |
AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
Journal of the Operations Research Society of Japan | 1990-01-01 | Paper |
Strategic Manipulation in a Society with Indivisible Goods
Journal of the Operations Research Society of Japan | 1990-01-01 | Paper |
A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
Journal of the Operations Research Society of Japan | 1990-01-01 | Paper |
Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4164543 (Why is no real title available?) | 1989-01-01 | Paper |
A polynomial-time algorithm for a class of linear complementarity problems
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
A new continuation method for complementarity problems with uniform P- functions
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
Journal of the Operations Research Society of Japan | 1989-01-01 | Paper |
POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
Journal of the Operations Research Society of Japan | 1989-01-01 | Paper |
ALGORITHMS USING A BRANCH AND BOUND METHOD FOR FINDING ALL REAL SOLUTIONS TO AN EQUATION OF ONE VARIABLE
Journal of the Operations Research Society of Japan | 1989-01-01 | Paper |
SOLUTION ALGORITHMS OF A SYSTEM OF EQUATIONS AND MINIMIZATION OF A FUNCTION BY A BRANCH AND BOUND METHOD
Journal of the Operations Research Society of Japan | 1987-01-01 | Paper |
An analysis of the solution set to a homotopy equation between polynomials with real coefficients
Mathematical Programming | 1984-01-01 | Paper |
Computation of all solutions to a system of polynomial equations
Mathematical Programming | 1983-01-01 | Paper |
