The following pages link to iOptimize (Q32196):
Displaying 5 items.
- A homogeneous model for monotone mixed horizontal linear complementarity problems (Q1734775) (← links)
- A robust stochastic casualty collection points location problem (Q2315652) (← links)
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
- An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games (Q5087713) (← links)
- Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method (Q5739130) (← links)
