Short pages
Jump to navigation
Jump to search
Showing below up to 25 results in range #51 to #75.
- (hist) Heuristic algorithms [17,547 bytes]
- (hist) Nonconvex generalized disjunctive programming (GDP) [17,549 bytes]
- (hist) Lagrangean duality [17,642 bytes]
- (hist) Optimization in game theory [17,858 bytes]
- (hist) Chance-constraint method [17,878 bytes]
- (hist) Outer-approximation (OA) [17,966 bytes]
- (hist) Wing shape optimization [18,262 bytes]
- (hist) Trust-region methods [18,656 bytes]
- (hist) Frank-Wolfe [18,763 bytes]
- (hist) Bayesian Optimization [18,896 bytes]
- (hist) Mathematical programming with equilibrium constraints [19,301 bytes]
- (hist) Generalized Benders decomposition (GBD) [21,340 bytes]
- (hist) Line search methods [21,364 bytes]
- (hist) Interior-point method for NLP [21,435 bytes]
- (hist) Job shop scheduling [22,583 bytes]
- (hist) Stochastic programming [24,469 bytes]
- (hist) Mixed-integer linear fractional programming (MILFP) [25,186 bytes]
- (hist) Column generation algorithms [26,249 bytes]
- (hist) Set covering problem [27,405 bytes]
- (hist) Traveling salesman problem [31,070 bytes]
- (hist) Adaptive robust optimization [32,942 bytes]
- (hist) Conjugate gradient methods [33,089 bytes]
- (hist) Network flow problem [37,614 bytes]
- (hist) Stochastic dynamic programming [42,226 bytes]
- (hist) Sparse Reconstruction with Compressed Sensing [43,411 bytes]