The following pages link to Shinji Mizuno (Q173893):
Displaying 50 items.
- On the number of solutions generated by the dual simplex method (Q439907) (← links)
- A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming (Q805163) (← links)
- A new continuation method for complementarity problems with uniform P- functions (Q1121180) (← links)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
- Strict monotonicity in Todd's low-complexity algorithm for linear programming (Q1200765) (← links)
- A new polynomial time method for a linear complementarity problem (Q1207309) (← links)
- A modified layered-step interior-point algorithm for linear programming (Q1290624) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- Polynomiality of infeasible-interior-point algorithms for linear programming (Q1340070) (← links)
- A predictor-corrector infeasible-interior-point algorithm for linear programming (Q1342276) (← links)
- A conjugate direction method for approximating the analytic center of a polytope (Q1386699) (← links)
- Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. (Q1572663) (← links)
- On the separation in 2-period double round robin tournaments with minimum breaks (Q1762158) (← links)
- A primal-simplex based Tardos' algorithm (Q1785451) (← links)
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
- A bound for the number of different basic solutions generated by the simplex method (Q1942281) (← links)
- A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource (Q2059081) (← links)
- A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem (Q2228402) (← links)
- Klee-Minty's LP and upper bounds for Dantzig's simplex method (Q2275570) (← links)
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
- An approximation algorithm for the partial covering 0-1 integer program (Q2297657) (← links)
- Approximation algorithms for the covering-type \(k\)-violation linear program (Q2329669) (← links)
- Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs (Q2355203) (← links)
- Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry (Q2358497) (← links)
- A linear programming instance with many crossover events (Q2365418) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- Determination of optimal vertices from feasible solutions in unimodular linear programming (Q2366606) (← links)
- The LP-Newton method for standard form linear programming problems (Q2450681) (← links)
- Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks (Q2450701) (← links)
- Dynamic pricing and inventory management of a dual-channel supply chain under different power structures (Q2673576) (← links)
- High order infeasible-interior-point methods for solving sufficient linear complementarity problems (Q2757568) (← links)
- Convergence of a class of inexact interior-point algorithms for linear programs (Q2757582) (← links)
- The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption (Q2829586) (← links)
- On the generalized mirrored scheme for double round robin tournaments in sports scheduling (Q2846487) (← links)
- An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables (Q2846492) (← links)
- On the Number of Solutions Generated by the Simplex Method for LP (Q2948780) (← links)
- LOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE SIMPLEX METHOD(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) (Q3144758) (← links)
- A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS (Q3202103) (← links)
- AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM (Q3202145) (← links)
- POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS (Q3204329) (← links)
- Strategic Manipulation in a Society with Indivisible Goods (Q3211076) (← links)
- An analysis of the solution set to a homotopy equation between polynomials with real coefficients (Q3341775) (← links)
- (Q3491304) (← links)
- PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS (Q3491306) (← links)
- QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS (Q3535164) (← links)
