Long pages

Showing below up to 20 results in range #21 to #40.

21. (hist) ‎Chance-constraint method ‎[17,878 bytes]
22. (hist) ‎Optimization in game theory ‎[17,858 bytes]
23. (hist) ‎Lagrangean duality ‎[17,642 bytes]
24. (hist) ‎Nonconvex generalized disjunctive programming (GDP) ‎[17,549 bytes]
25. (hist) ‎Heuristic algorithms ‎[17,547 bytes]
26. (hist) ‎A-star algorithm ‎[17,434 bytes]
27. (hist) ‎Markov decision process ‎[17,354 bytes]
28. (hist) ‎Optimization with absolute values ‎[17,198 bytes]
29. (hist) ‎Facility location problem ‎[17,152 bytes]
30. (hist) ‎Quasi-Newton methods ‎[17,087 bytes]
31. (hist) ‎AdaGrad ‎[16,828 bytes]
32. (hist) ‎Quadratic assignment problem ‎[16,801 bytes]
33. (hist) ‎Matrix game (LP for game theory) ‎[16,769 bytes]
34. (hist) ‎Stochastic gradient descent ‎[16,327 bytes]
35. (hist) ‎Simplex algorithm ‎[15,987 bytes]
36. (hist) ‎Quadratic programming ‎[15,980 bytes]
37. (hist) ‎Interior-point method for LP ‎[15,602 bytes]
38. (hist) ‎Spatial branch and bound method ‎[15,595 bytes]
39. (hist) ‎Duality ‎[15,224 bytes]
40. (hist) ‎Disjunctive inequalities ‎[14,832 bytes]