Oldest pages

Jump to navigation Jump to search

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

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  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. Computational complexity‏‎ (07:30, 21 December 2020)
  9. Interior-point method for LP‏‎ (07:31, 21 December 2020)
  10. Optimization with absolute values‏‎ (07:31, 21 December 2020)
  11. Matrix game (LP for game theory)‏‎ (07:32, 21 December 2020)
  12. Network flow problem‏‎ (07:33, 21 December 2020)
  13. Markov decision process‏‎ (07:34, 21 December 2020)
  14. Eight step procedures‏‎ (07:35, 21 December 2020)
  15. Facility location problem‏‎ (07:35, 21 December 2020)
  16. Set covering problem‏‎ (07:36, 21 December 2020)
  17. Newsvendor problem‏‎ (07:36, 21 December 2020)
  18. Column generation algorithms‏‎ (07:37, 21 December 2020)
  19. Heuristic algorithms‏‎ (07:37, 21 December 2020)
  20. Branch and cut‏‎ (07:38, 21 December 2020)
  21. Mixed-integer linear fractional programming (MILFP)‏‎ (07:38, 21 December 2020)
  22. Fuzzy programming‏‎ (07:40, 21 December 2020)
  23. Convex generalized disjunctive programming (GDP)‏‎ (07:40, 21 December 2020)
  24. Adaptive robust optimization‏‎ (07:41, 21 December 2020)
  25. Stochastic gradient descent‏‎ (07:41, 21 December 2020)
  26. Duality‏‎ (10:44, 4 September 2021)
  27. Simplex algorithm‏‎ (08:26, 5 October 2021)
  28. Local branching‏‎ (19:42, 18 October 2021)
  29. Bellman equation‏‎ (17:14, 28 November 2021)
  30. Interior-point method for NLP‏‎ (09:49, 7 December 2021)
  31. Geometric programming‏‎ (15:40, 11 December 2021)
  32. McCormick envelopes‏‎ (08:21, 12 December 2021)
  33. Branch and bound for MINLP‏‎ (21:56, 14 December 2021)
  34. AdaGrad‏‎ (22:03, 14 December 2021)
  35. Exponential transformation‏‎ (00:06, 15 December 2021)
  36. Optimization in game theory‏‎ (12:02, 15 December 2021)
  37. Piecewise linear approximation‏‎ (16:29, 15 December 2021)
  38. Job shop scheduling‏‎ (16:46, 15 December 2021)
  39. Mathematical programming with equilibrium constraints‏‎ (17:10, 15 December 2021)
  40. Momentum‏‎ (20:24, 15 December 2021)
  41. A-star algorithm‏‎ (22:26, 15 December 2021)
  42. Frank-Wolfe‏‎ (22:49, 15 December 2021)
  43. Lagrangean duality‏‎ (23:01, 15 December 2021)
  44. Disjunctive inequalities‏‎ (23:06, 15 December 2021)
  45. Chance-constraint method‏‎ (23:43, 15 December 2021)
  46. Outer-approximation (OA)‏‎ (00:12, 16 December 2021)
  47. Branch and bound (BB) for MINLP‏‎ (00:58, 16 December 2021)
  48. Stochastic programming‏‎ (00:59, 16 December 2021)
  49. Wing shape optimization‏‎ (00:59, 16 December 2021)
  50. Stochastic dynamic programming‏‎ (01:10, 16 December 2021)

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)