| 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 | 2023-01-31 | Paper |
| Dynamic pricing and inventory management of a dual-channel supply chain under different power structures | 2022-06-10 | Paper |
| A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource | 2021-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4963655 | 2021-02-19 | Paper |
| A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem | 2021-02-17 | Paper |
| An approximation algorithm for the partial covering 0-1 integer program | 2020-02-20 | Paper |
| Approximation algorithms for the covering-type \(k\)-violation linear program | 2019-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645555 | 2019-01-10 | Paper |
| A primal-simplex based Tardos' algorithm | 2018-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376370 | 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 | 2018-03-29 | Paper |
| Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry | 2017-06-15 | Paper |
| A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH | 2017-06-13 | Paper |
| The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption | 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 | 2015-10-06 | Paper |
| Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs | 2015-07-21 | Paper |
| The LP-Newton method for standard form linear programming problems | 2014-05-15 | Paper |
| Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks | 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 | 2013-09-05 | Paper |
| On the generalized mirrored scheme for double round robin tournaments in sports scheduling | 2013-09-05 | Paper |
| A bound for the number of different basic solutions generated by the simplex method | 2013-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4906130 | 2013-02-07 | Paper |
| LOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE SIMPLEX METHOD(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) | 2012-12-08 | Paper |
| On the separation in 2-period double round robin tournaments with minimum breaks | 2012-11-15 | Paper |
| On the number of solutions generated by the dual simplex method | 2012-08-17 | Paper |
| Klee-Minty's LP and upper bounds for Dantzig's simplex method | 2011-08-09 | Paper |
| QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS | 2008-11-10 | Paper |
| AN EXTENSION OF A MINIMAX APPROACH TO MULTIPLE CLASSIFICATION | 2008-04-29 | Paper |
| AN EXTENSION OF A MINIMAX APPROACH TO MULTIPLE CLASSIFICATION | 2008-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5462187 | 2005-08-01 | Paper |
| High order infeasible-interior-point methods for solving sufficient linear complementarity problems | 2001-11-26 | Paper |
| Convergence of a class of inexact interior-point algorithms for linear programs | 2001-11-26 | Paper |
| On two homogeneous self-dual approaches to linear programming and its extensions. | 2001-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496026 | 2001-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250861 | 2000-10-25 | Paper |
| Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. | 2000-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705458 | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705034 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253467 | 1999-08-09 | Paper |
| A modified layered-step interior-point algorithm for linear programming | 1999-06-03 | Paper |
| A conjugate direction method for approximating the analytic center of a polytope | 1998-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347845 | 1997-08-11 | Paper |
| A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition | 1997-03-11 | Paper |
| A linear programming instance with many crossover events | 1997-02-04 | Paper |
| An infeasible-interior-point algorithm using projections onto a convex set | 1996-07-01 | Paper |
| A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems | 1996-06-02 | Paper |
| A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming | 1995-07-31 | Paper |
| Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming | 1995-05-30 | Paper |
| A predictor-corrector infeasible-interior-point algorithm for linear programming | 1995-01-11 | Paper |
| Polynomiality of infeasible-interior-point algorithms for linear programming | 1994-12-11 | Paper |
| An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm | 1994-11-17 | Paper |
| Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms | 1994-10-04 | Paper |
| A little theorem of the big \({\mathcal M}\) in interior point algorithms | 1994-08-16 | Paper |
| A primal-dual affine-scaling potential-reduction algorithm for linear programming | 1994-04-28 | Paper |
| On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming | 1994-04-12 | Paper |
| A General Framework of Continuation Methods for Complementarity Problems | 1994-04-12 | Paper |
| A primal-dual infeasible-interior-point algorithm for linear programming | 1994-03-10 | Paper |
| Theoretical convergence of large-step primal-dual interior point algorithms for linear programming | 1993-08-30 | Paper |
| Determination of optimal vertices from feasible solutions in unimodular linear programming | 1993-08-30 | Paper |
| Large-Step Interior Point Algorithms for Linear Complementarity Problems | 1993-08-11 | Paper |
| A new polynomial time method for a linear complementarity problem | 1993-04-01 | Paper |
| Strict monotonicity in Todd's low-complexity algorithm for linear programming | 1993-01-16 | Paper |
| An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem | 1992-06-27 | Paper |
| An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems | 1992-06-25 | Paper |
| O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming | 1991-01-01 | Paper |
| Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems | 1990-01-01 | Paper |
| AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM | 1990-01-01 | Paper |
| Strategic Manipulation in a Society with Indivisible Goods | 1990-01-01 | Paper |
| A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750715 | 1990-01-01 | Paper |
| Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3491304 | 1989-01-01 | Paper |
| A polynomial-time algorithm for a class of linear complementarity problems | 1989-01-01 | Paper |
| A new continuation method for complementarity problems with uniform P- functions | 1989-01-01 | Paper |
| PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS | 1989-01-01 | Paper |
| POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS | 1989-01-01 | Paper |
| ALGORITHMS USING A BRANCH AND BOUND METHOD FOR FINDING ALL REAL SOLUTIONS TO AN EQUATION OF ONE VARIABLE | 1989-01-01 | Paper |
| SOLUTION ALGORITHMS OF A SYSTEM OF EQUATIONS AND MINIMIZATION OF A FUNCTION BY A BRANCH AND BOUND METHOD | 1987-01-01 | Paper |
| An analysis of the solution set to a homotopy equation between polynomials with real coefficients | 1984-01-01 | Paper |
| Computation of all solutions to a system of polynomial equations | 1983-01-01 | Paper |
