Pages with the most revisions

Jump to navigation Jump to search

Showing below up to 55 results in range #21 to #75.

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

  1. Network flow problem‏‎ (92 revisions)
  2. Stochastic gradient descent‏‎ (76 revisions)
  3. Unit commitment problem‏‎ (76 revisions)
  4. Optimization with absolute values‏‎ (76 revisions)
  5. Exponential transformation‏‎ (68 revisions)
  6. Job shop scheduling‏‎ (68 revisions)
  7. Stochastic programming‏‎ (68 revisions)
  8. Fuzzy programming‏‎ (66 revisions)
  9. Mathematical programming with equilibrium constraints‏‎ (66 revisions)
  10. Geometric programming‏‎ (65 revisions)
  11. Facility location problem‏‎ (64 revisions)
  12. Momentum‏‎ (61 revisions)
  13. Adam‏‎ (60 revisions)
  14. Wing shape optimization‏‎ (60 revisions)
  15. Quasi-Newton methods‏‎ (58 revisions)
  16. Newsvendor problem‏‎ (57 revisions)
  17. Mixed-integer cuts‏‎ (50 revisions)
  18. A-star algorithm‏‎ (48 revisions)
  19. Convex generalized disjunctive programming (GDP)‏‎ (46 revisions)
  20. Branch and cut‏‎ (46 revisions)
  21. Heuristic algorithms‏‎ (45 revisions)
  22. Main Page‏‎ (45 revisions)
  23. Trust-region methods‏‎ (44 revisions)
  24. Eight step procedures‏‎ (43 revisions)
  25. Simplex algorithm‏‎ (42 revisions)
  26. 2020 Cornell Optimization Open Textbook Feedback‏‎ (41 revisions)
  27. Portfolio optimization‏‎ (41 revisions)
  28. Matrix game (LP for game theory)‏‎ (39 revisions)
  29. Chance-constraint method‏‎ (31 revisions)
  30. Adaptive robust optimization‏‎ (27 revisions)
  31. RMSProp‏‎ (27 revisions)
  32. Branch and bound for MINLP‏‎ (26 revisions)
  33. Optimization in game theory‏‎ (26 revisions)
  34. Markov decision process‏‎ (26 revisions)
  35. Sequential quadratic programming‏‎ (18 revisions)
  36. Computational complexity‏‎ (16 revisions)
  37. Quadratic programming‏‎ (8 revisions)
  38. Subgradient optimization‏‎ (8 revisions)
  39. Traveling salesman problem‏‎ (5 revisions)
  40. Branch and bound (BB) for MINLP‏‎ (5 revisions)
  41. Nondifferentiable Optimization‏‎ (5 revisions)
  42. Data driven robust optimization‏‎ (4 revisions)
  43. Bellman equation‏‎ (4 revisions)
  44. About‏‎ (3 revisions)
  45. Dynamic optimization‏‎ (3 revisions)
  46. Branch and cut for MINLP‏‎ (3 revisions)
  47. Logarithmic transformation‏‎ (2 revisions)
  48. Nonconvex generalized disjunctive programming (GDP)‏‎ (2 revisions)
  49. Quantum computing for optimization‏‎ (2 revisions)
  50. Spatial branch and bound method‏‎ (2 revisions)
  51. Classical robust optimization‏‎ (2 revisions)
  52. Extended cutting plane (ECP)‏‎ (2 revisions)
  53. Generalized Benders decomposition (GBD)‏‎ (2 revisions)
  54. Local branching‏‎ (2 revisions)
  55. Signomial problems‏‎ (1 revision)

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