Misplaced Pages

The following pages link to Comparison of optimization software

• (link count
• transclusion count
• sorted list) · See help page for transcluding these entries

Showing 50 items.

• Iterative method (links | edit)
• Newton's method (links | edit)
• Quadratic programming (links | edit)
• Linear programming (links | edit)
• Dijkstra's algorithm (links | edit)
• Wolfram Mathematica (links | edit)
• Mathematical optimization (links | edit)
• Greedy algorithm (links | edit)
• Dynamic programming (links | edit)
• Gradient descent (links | edit)
• Floyd–Warshall algorithm (links | edit)
• Edmonds–Karp algorithm (links | edit)
• Simplex algorithm (links | edit)
• Hill climbing (links | edit)
• Tabu search (links | edit)
• Integer programming (links | edit)
• Combinatorial optimization (links | edit)
• Discrete optimization (links | edit)
• Branch and bound (links | edit)
• Register allocation (links | edit)
• Approximation algorithm (links | edit)
• Global optimization (links | edit)
• Ant colony optimization algorithms (links | edit)
• Nonlinear programming (links | edit)
• Column generation (links | edit)
• Swarm intelligence (links | edit)
• Metaheuristic (links | edit)
• Levenberg–Marquardt algorithm (links | edit)
• GNU Linear Programming Kit (links | edit)
• AMPL (links | edit)
• Gauss–Newton algorithm (links | edit)
• Newton's method in optimization (links | edit)
• CPLEX (links | edit)
• General algebraic modeling system (links | edit)
• Line search (links | edit)
• Cutting-plane method (links | edit)
• Interior-point method (links | edit)
• Wolfe conditions (links | edit)
• Convex optimization (links | edit)
• Golden-section search (links | edit)
• Broyden–Fletcher–Goldfarb–Shanno algorithm (links | edit)
• MPS (format) (links | edit)
• Nelder–Mead method (links | edit)
• ECLiPSe (links | edit)
• IPOPT (links | edit)
• SNOPT (links | edit)
• Trust region (links | edit)
• Frank–Wolfe algorithm (links | edit)
• MINTO (links | edit)
• Branch and cut (links | edit)