Oldest pages

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

1. Traveling salesman problem‏‎ (21:47, 25 September 2020)
2. Quantum computing for optimization‏‎ (12:22, 23 November 2020)
3. Mixed-integer cuts‏‎ (22:07, 13 December 2020)
4. Quadratic assignment problem‏‎ (23:51, 13 December 2020)
5. Quasi-Newton methods‏‎ (05:21, 21 December 2020)
6. RMSProp‏‎ (06:05, 21 December 2020)
7. 2020 Cornell Optimization Open Textbook Feedback‏‎ (06:12, 21 December 2020)
8. Interior-point method for LP‏‎ (06:31, 21 December 2020)
9. Optimization with absolute values‏‎ (06:31, 21 December 2020)
10. Matrix game (LP for game theory)‏‎ (06:32, 21 December 2020)
11. Network flow problem‏‎ (06:33, 21 December 2020)
12. Markov decision process‏‎ (06:34, 21 December 2020)
13. Facility location problem‏‎ (06:35, 21 December 2020)
14. Set covering problem‏‎ (06:36, 21 December 2020)
15. Newsvendor problem‏‎ (06:36, 21 December 2020)
16. Branch and cut‏‎ (06:38, 21 December 2020)
17. Mixed-integer linear fractional programming (MILFP)‏‎ (06:38, 21 December 2020)
18. Fuzzy programming‏‎ (06:40, 21 December 2020)
19. Convex generalized disjunctive programming (GDP)‏‎ (06:40, 21 December 2020)
20. Adaptive robust optimization‏‎ (06:41, 21 December 2020)
21. Stochastic gradient descent‏‎ (06:41, 21 December 2020)
22. Simplex algorithm‏‎ (07:26, 5 October 2021)
23. Bellman equation‏‎ (16:14, 28 November 2021)
24. Interior-point method for NLP‏‎ (08:49, 7 December 2021)
25. Geometric programming‏‎ (14:40, 11 December 2021)
26. McCormick envelopes‏‎ (07:21, 12 December 2021)
27. Branch and bound for MINLP‏‎ (20:56, 14 December 2021)
28. AdaGrad‏‎ (21:03, 14 December 2021)
29. Exponential transformation‏‎ (23:06, 14 December 2021)
30. Optimization in game theory‏‎ (11:02, 15 December 2021)
31. Piecewise linear approximation‏‎ (15:29, 15 December 2021)
32. Job shop scheduling‏‎ (15:46, 15 December 2021)
33. Mathematical programming with equilibrium constraints‏‎ (16:10, 15 December 2021)
34. Momentum‏‎ (19:24, 15 December 2021)
35. A-star algorithm‏‎ (21:26, 15 December 2021)
36. Frank-Wolfe‏‎ (21:49, 15 December 2021)
37. Lagrangean duality‏‎ (22:01, 15 December 2021)
38. Disjunctive inequalities‏‎ (22:06, 15 December 2021)
39. Chance-constraint method‏‎ (22:43, 15 December 2021)
40. Outer-approximation (OA)‏‎ (23:12, 15 December 2021)
41. Branch and bound (BB) for MINLP‏‎ (23:58, 15 December 2021)
42. Stochastic programming‏‎ (23:59, 15 December 2021)
43. Wing shape optimization‏‎ (23:59, 15 December 2021)
44. Stochastic dynamic programming‏‎ (00:10, 16 December 2021)
45. Unit commitment problem‏‎ (00:46, 16 December 2021)
46. Line search methods‏‎ (05:35, 16 December 2021)
47. Adam‏‎ (14:19, 16 December 2021)
48. Portfolio optimization‏‎ (18:55, 17 December 2021)
49. Bayesian Optimization‏‎ (19:23, 19 December 2021)
50. 2021 Cornell Optimization Open Textbook Feedback‏‎ (16:52, 21 December 2021)