The following pages link to István Maros (Q240126):
Displaying 50 items.
- (Q587980) (redirect page) (← links)
- Approximate multiparametric sensitivity analysis of the constraint matrix in linear-plus-linear fractional programming problem (Q849776) (← links)
- Computational study of the GDPO dual phase-1 algorithm (Q970138) (← links)
- Special issue on ``Optimization models in environment and sustainable development'' (Q1034993) (← links)
- A general phase-I method in linear programming (Q1069441) (← links)
- On duality and the maximum principle for continuous linear programming problems (Q1072942) (← links)
- Degeneracy in transportation problems (Q1082263) (← links)
- Some remarks concerning duality for continuous-time programming problems (Q1084028) (← links)
- Application of geometric programming to optimum allocation problems in multivariate doubling sampling (Q1091946) (← links)
- A parallel subgradient projections method for the convex feasibility problem (Q1091948) (← links)
- On the construction of minimization methods of quasi-Newton type (Q1096337) (← links)
- A constraint linearization method for nondifferentiable convex minimization (Q1099787) (← links)
- Separation process optimization calculations (Q1099788) (← links)
- (Q1123125) (redirect page) (← links)
- Time-cost tradeoff in a three-dimensional assignment problem (Q1123126) (← links)
- Mathematical programming with iterative aggregation (Q1175776) (← links)
- Optimization, approximation, and complexity classes (Q1186548) (← links)
- A collection of test problems for constrained global optimization algorithms (Q1188890) (← links)
- Detecting embedded pure network structures in LP problems (Q1265245) (← links)
- The role of the augmented system in interior point methods (Q1296137) (← links)
- A practical anti-degeneracy row selection technique in network linear programming (Q1312776) (← links)
- Asymptotic analysis of the exponential penalty trajectory in linear programming (Q1341567) (← links)
- A piecewise linear dual phase-1 algorithm for the simplex method (Q1410240) (← links)
- A general pricing scheme for the simplex method (Q1417781) (← links)
- Detecting embedded networks in LP using GUB structures and independent set algorithms (Q1567484) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- Investigating the sparse simplex algorithm on a distributed memory multiprocessor (Q1606889) (← links)
- A robust SQP method based on a smoothing approximate penalty function for inequality constrained optimization. (Q1607579) (← links)
- Parallel search paths for the simplex algorithm (Q1642812) (← links)
- A generalized dual phase-2 simplex algorithm. (Q1811141) (← links)
- Fast finite methods for a system of linear inequalities (Q1819897) (← links)
- Computational techniques of the simplex method (Q1860337) (← links)
- A numerically exact implementation of the simplex method (Q1904700) (← links)
- A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm (Q1974584) (← links)
- Directional derivative of the value function in parametric optimization (Q2277158) (← links)
- Optimal weekly scheduling in fractionated radiotherapy: effect of an upper bound on the dose fraction size (Q2355786) (← links)
- An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems (Q2774597) (← links)
- (Q3428851) (← links)
- (Q3494699) (← links)
- (Q3840329) (← links)
- (Q3877404) (← links)
- (Q3929393) (← links)
- (Q4180134) (← links)
- (Q4283441) (← links)
- (Q4355912) (← links)
- Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems (Q4427345) (← links)
- A repository of convex quadratic programming problems (Q4504798) (← links)
- (Q4747911) (← links)
- Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm (Q5936075) (← links)
- Creating advanced bases for large scale linear programs exploiting embedded network structure (Q5960292) (← links)
