Pages with the fewest revisions

Showing below up to 44 results in range #51 to #94.

51. Eight step procedures (55 revisions)
52. Newsvendor problem (57 revisions)
53. Quasi-Newton methods (58 revisions)
54. Genetic algorithm (58 revisions)
55. Trust-region methods (60 revisions)
56. Adam (60 revisions)
57. Wing shape optimization (60 revisions)
58. Momentum (61 revisions)
59. Facility location problem (64 revisions)
60. Geometric programming (65 revisions)
61. Mathematical programming with equilibrium constraints (66 revisions)
62. Fuzzy programming (66 revisions)
63. Local branching (67 revisions)
64. Job shop scheduling (68 revisions)
65. Exponential transformation (68 revisions)
66. Stochastic programming (68 revisions)
67. Heuristic algorithms (69 revisions)
68. Optimization with absolute values (76 revisions)
69. Unit commitment problem (76 revisions)
70. Stochastic gradient descent (76 revisions)
71. Adafactor (92 revisions)
72. Network flow problem (92 revisions)
73. AdaGrad (97 revisions)
74. Column generation algorithms (107 revisions)
75. McCormick envelopes (107 revisions)
76. Frank-Wolfe (107 revisions)
77. Particle swarm optimization (108 revisions)
78. Lagrangean duality (111 revisions)
79. Duality (121 revisions)
80. Piecewise linear approximation (121 revisions)
81. Derivative free optimization (124 revisions)
82. Interior-point method for LP (128 revisions)
83. Interior-point method for NLP (129 revisions)
84. Quadratic assignment problem (133 revisions)
85. Bayesian Optimization (134 revisions)
86. Set covering problem (135 revisions)
87. Mixed-integer linear fractional programming (MILFP) (141 revisions)
88. 2021 Cornell Optimization Open Textbook Feedback (143 revisions)
89. Outer-approximation (OA) (152 revisions)
90. Conjugate gradient methods (158 revisions)
91. Disjunctive inequalities (190 revisions)
92. Stochastic dynamic programming (281 revisions)
93. Line search methods (348 revisions)
94. Sparse Reconstruction with Compressed Sensing (584 revisions)