The following pages link to (Q4288838):
Displaying 10 items.
- A regression study of the number of efficient extreme points in multiple objective linear programming (Q706929) (← links)
- Using aspiration levels in an interactive interior multiobjective linear programming algorithm (Q1266671) (← links)
- Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm (Q1266672) (← links)
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming (Q1342884) (← links)
- An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points (Q1373875) (← links)
- On multidimensional inequality with variable distribution mean (Q2427845) (← links)
- An interior multiobjective primal-dual linear programming algorithm using approximated gradients and sequential generation of anchor points (Q4764862) (← links)
- Generating interior search directions for multiobjective linear programming (Q4860737) (← links)
- (Q5688012) (← links)
- A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) (Q6113557) (← links)
