The following pages link to Emil Klafszky (Q1262208):
Displayed 32 items.
- Item:Q1262208 (redirect page) (← links)
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (Q584271) (← links)
- Linearly constrained estimation by mathematical programming (Q1262209) (← links)
- On the dual of linear inverse problems (Q1278264) (← links)
- Approximation of linear programs by Bregman's \(D_F\) projections (Q1584816) (← links)
- Optimization techniques for planning highway pavement improvements (Q1904707) (← links)
- Convex programs based on the Young inequality and its relation to linear programming (Q1975984) (← links)
- The role of pivoting in proving some fundamental theorems of linear algebra (Q2644727) (← links)
- (Q2756261) (← links)
- (Q3198693) (← links)
- (Q3347645) (← links)
- (Q3360010) (← links)
- (Q3768671) (← links)
- (Q3768919) (← links)
- (Q3779590) (← links)
- (Q3783068) (← links)
- (Q3831021) (← links)
- On the duality of the mixed entropy programming (Q3835667) (← links)
- (Q4041337) (← links)
- (Q4220471) (← links)
- (Q4254537) (← links)
- Some generalizations of the criss-cross method for quadratic programming (Q4327908) (← links)
- (Q4362218) (← links)
- (Q4515200) (← links)
- (Q4710542) (← links)
- Variants of the Hungarian method for solving linear programming problems (Q4729607) (← links)
- (Q4749555) (← links)
- (Q4937977) (← links)
- (Q5286133) (← links)
- Determination of shortest path in a network with time-dependent edge-lengths<sup>1</sup> (Q5663673) (← links)
- (Q5750719) (← links)
- (Q5753743) (← links)