Long pages

Showing below up to 50 results in range #1 to #50.

1. (hist) ‎Sparse Reconstruction with Compressed Sensing ‎[43,411 bytes]
2. (hist) ‎Stochastic dynamic programming ‎[42,226 bytes]
3. (hist) ‎Network flow problem ‎[37,614 bytes]
4. (hist) ‎Conjugate gradient methods ‎[33,089 bytes]
5. (hist) ‎Adaptive robust optimization ‎[32,942 bytes]
6. (hist) ‎Traveling salesman problem ‎[31,070 bytes]
7. (hist) ‎Set covering problem ‎[27,405 bytes]
8. (hist) ‎Column generation algorithms ‎[26,249 bytes]
9. (hist) ‎Mixed-integer linear fractional programming (MILFP) ‎[25,186 bytes]
10. (hist) ‎Stochastic programming ‎[24,469 bytes]
11. (hist) ‎Job shop scheduling ‎[22,583 bytes]
12. (hist) ‎Interior-point method for NLP ‎[21,435 bytes]
13. (hist) ‎Line search methods ‎[21,364 bytes]
14. (hist) ‎Generalized Benders decomposition (GBD) ‎[21,340 bytes]
15. (hist) ‎Mathematical programming with equilibrium constraints ‎[19,301 bytes]
16. (hist) ‎Bayesian Optimization ‎[18,896 bytes]
17. (hist) ‎Frank-Wolfe ‎[18,763 bytes]
18. (hist) ‎Trust-region methods ‎[18,656 bytes]
19. (hist) ‎Wing shape optimization ‎[18,262 bytes]
20. (hist) ‎Outer-approximation (OA) ‎[17,966 bytes]
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]
41. (hist) ‎Logarithmic transformation ‎[14,601 bytes]
42. (hist) ‎Momentum ‎[14,389 bytes]
43. (hist) ‎Newsvendor problem ‎[14,234 bytes]
44. (hist) ‎Sequential quadratic programming ‎[14,076 bytes]
45. (hist) ‎Exponential transformation ‎[13,814 bytes]
46. (hist) ‎Piecewise linear approximation ‎[13,616 bytes]
47. (hist) ‎Unit commitment problem ‎[13,249 bytes]
48. (hist) ‎Data driven robust optimization ‎[13,101 bytes]
49. (hist) ‎Branch and cut for MINLP ‎[13,073 bytes]
50. (hist) ‎Mixed-integer cuts ‎[13,066 bytes]