Oldest pages

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

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