The following pages link to Tibor Illés (Q317430):
Displaying 48 items.
- (Q180481) (redirect page) (← links)
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- Optimality criteria for general unconstrained geometric programming problems (Q811403) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems (Q877592) (← links)
- A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885) (← links)
- EP theorem for dual linear complementarity problems (Q1016385) (← links)
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming (Q1291813) (← links)
- Pseudoconvex optimization for a special problem of paint industry (Q1342653) (← links)
- Optimization of nuclear reactor reloading patterns (Q1357771) (← links)
- Entropy and Young programs: Relations and self-concordance. (Q1412115) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
- The finite criss-cross method for hyperbolic programming (Q1809838) (← links)
- New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024) (← links)
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming (Q1926882) (← links)
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
- A corrector-predictor interior-point method with new search direction for linear optimization (Q2201317) (← links)
- Market exchange models and geometric programming (Q2418159) (← links)
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
- A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems (Q2706331) (← links)
- (Q2714255) (← links)
- (Q2834253) (← links)
- (Q2867373) (← links)
- (Q3428832) (← links)
- (Q3499368) (← links)
- (Q3824120) (← links)
- (Q3982818) (← links)
- (Q4220478) (← links)
- (Q4362984) (← links)
- (Q4384871) (← links)
- (Q4435041) (← links)
- (Q4615209) (← links)
- (Q4764328) (← links)
- (Q4815591) (← links)
- (Q4816526) (← links)
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)
- The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems (Q5167105) (← links)
- On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds (Q5413870) (← links)
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules (Q5413871) (← links)
- Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems (Q5436927) (← links)
- (Q5446957) (← links)
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices (Q5478870) (← links)
- Upper bounds on the covering number of Galois-planes with small order (Q5933518) (← links)
- EUR\(O\)pt, the continuous optimization working group of EURO: from idea to maturity (Q6114937) (← links)
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation (Q6491339) (← links)
- Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations (Q6596327) (← links)
- Sufficient matrices: properties, generating and testing (Q6596334) (← links)