Short pages

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

1. (hist) ‎Local branching ‎[0 bytes]
2. (hist) ‎Bellman equation ‎[498 bytes]
3. (hist) ‎About ‎[1,066 bytes]
4. (hist) ‎Quantum computing for optimization ‎[1,713 bytes]
5. (hist) ‎2020 Cornell Optimization Open Textbook Feedback ‎[3,934 bytes]
6. (hist) ‎Classical robust optimization ‎[4,435 bytes]
7. (hist) ‎Extended cutting plane (ECP) ‎[7,009 bytes]
8. (hist) ‎2021 Cornell Optimization Open Textbook Feedback ‎[7,303 bytes]
9. (hist) ‎Main Page ‎[7,523 bytes]
10. (hist) ‎Signomial problems ‎[9,614 bytes]
11. (hist) ‎Nondifferentiable Optimization ‎[9,759 bytes]
12. (hist) ‎Eight step procedures ‎[10,080 bytes]
13. (hist) ‎McCormick envelopes ‎[10,342 bytes]
14. (hist) ‎Convex generalized disjunctive programming (GDP) ‎[10,386 bytes]
15. (hist) ‎Subgradient optimization ‎[10,662 bytes]
16. (hist) ‎Branch and cut ‎[11,260 bytes]
17. (hist) ‎RMSProp ‎[11,338 bytes]
18. (hist) ‎Portfolio optimization ‎[11,985 bytes]
19. (hist) ‎Computational complexity ‎[12,019 bytes]
20. (hist) ‎Dynamic optimization ‎[12,308 bytes]
21. (hist) ‎Geometric programming ‎[12,366 bytes]
22. (hist) ‎Branch and bound for MINLP ‎[12,507 bytes]
23. (hist) ‎Branch and bound (BB) for MINLP ‎[12,560 bytes]
24. (hist) ‎Fuzzy programming ‎[12,701 bytes]
25. (hist) ‎Adam ‎[12,774 bytes]
26. (hist) ‎Mixed-integer cuts ‎[13,066 bytes]
27. (hist) ‎Branch and cut for MINLP ‎[13,073 bytes]
28. (hist) ‎Data driven robust optimization ‎[13,101 bytes]
29. (hist) ‎Unit commitment problem ‎[13,249 bytes]
30. (hist) ‎Piecewise linear approximation ‎[13,616 bytes]
31. (hist) ‎Exponential transformation ‎[13,814 bytes]
32. (hist) ‎Sequential quadratic programming ‎[14,076 bytes]
33. (hist) ‎Newsvendor problem ‎[14,234 bytes]
34. (hist) ‎Momentum ‎[14,389 bytes]
35. (hist) ‎Logarithmic transformation ‎[14,601 bytes]
36. (hist) ‎Disjunctive inequalities ‎[14,832 bytes]
37. (hist) ‎Duality ‎[15,224 bytes]
38. (hist) ‎Spatial branch and bound method ‎[15,595 bytes]
39. (hist) ‎Interior-point method for LP ‎[15,602 bytes]
40. (hist) ‎Quadratic programming ‎[15,980 bytes]
41. (hist) ‎Simplex algorithm ‎[15,987 bytes]
42. (hist) ‎Stochastic gradient descent ‎[16,327 bytes]
43. (hist) ‎Matrix game (LP for game theory) ‎[16,769 bytes]
44. (hist) ‎Quadratic assignment problem ‎[16,801 bytes]
45. (hist) ‎AdaGrad ‎[16,828 bytes]
46. (hist) ‎Quasi-Newton methods ‎[17,087 bytes]
47. (hist) ‎Facility location problem ‎[17,152 bytes]
48. (hist) ‎Optimization with absolute values ‎[17,198 bytes]
49. (hist) ‎Markov decision process ‎[17,354 bytes]
50. (hist) ‎A-star algorithm ‎[17,434 bytes]