The following pages link to Jan Telgen (Q2426566):
Displaying 16 items.
- (Q1102181) (redirect page) (← links)
- Note on prime representations of convex polyhedral sets (Q1102183) (← links)
- Minimal representation of convex polyhedral sets (Q1158127) (← links)
- On relaxation methods for systems of linear inequalities (Q1159953) (← links)
- Unfair allocation of gains under the equal price allocation method in purchasing groups (Q2426568) (← links)
- Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740) (← links)
- Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints (Q3042870) (← links)
- A basis for modelling the costs of supplier selection: the economic tender quantity (Q3156652) (← links)
- Randomly generated polytopes for testing mathematical programming algorithms (Q3664841) (← links)
- OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations (Q3858015) (← links)
- (Q3917910) (← links)
- A Solvable Machine Maintenance Model with Applications (Q3923911) (← links)
- (Q3929386) (← links)
- Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra (Q4006337) (← links)
- (Q4171862) (← links)
- The complexity of linear programming (Q5904897) (← links)
