Home›Optimization Algorithm›ACM AreaBrowse ByACM AreaThis dimension groups algorithms by the ACM subject area they fall under. Wikipedia notes that the ACM Computing Classification System "is a subject classification system for computing devised by the Association for Computing Machinery," used to organize computing subjects by area. Browsing this way collects every algorithm classified under the same ACM area.FactsACM AreaSourcesComments (0)Reader Challenges (0)FactsComparisonEra of EmergenceWell-attested1939 CE 1ACM AreaFilter Results7 entriesCategoryAllApproximation Algorithms (1)Combinatorial Optimization Design Strategies (1)Constraint-Based Planning and Generation Algorithms (1)Gradient and Quasi-Newton Optimization Methods (2)Linear Programming Algorithms (2)Metaheuristic Optimization Algorithms (2)Numerical Search and Equilibrium Methods (2)Quantum Computing and Information (1)Root-Finding and Optimization (1)Scheduling Algorithms (3)Time ComplexityAllExponential Time -- O(2^n) (1)Polynomial Time -- O(n^k) (2)Quadratic Time -- O(n^2) (1)Design TechniqueAllApproximation Algorithms (4)Branch and Bound (1)Greedy Method (3)Heuristics (3)Iterative Refinement (1)Randomized Algorithms (1)Simulated Annealing (1)Invented ByAllBruce Donald (1)Hidetoshi Nishimori (1)Jens Axboe (1)Marco Dorigo (1)Marguerite Frank (1)Narendra Karmarkar (1)Tadashi Kadowaki (1)GroupAllApproximation Algorithms (1)Combinatorial Optimization Design Strategies (1)Constraint-Based Planning and Generation Algorithms (1)Gradient and Quasi-Newton Optimization Methods (2)Linear Programming Algorithms (2)Metaheuristic Optimization Algorithms (2)Numerical Search and Equilibrium Methods (2)Quantum Computing and Information (1)Root-Finding and Optimization (1)Scheduling Algorithms (3)Credited ToAllBruce Donald (1)Hidetoshi Nishimori (1)Jens Axboe (1)Marco Dorigo (1)Marguerite Frank (1)Narendra Karmarkar (1)Tadashi Kadowaki (1)Origin YearAll1936 (1)1956 (1)1960 (1)1961 (1)1980 (1)1991 (1)Show ResultsBrowseCompareAlgorithms and Complexity TheoryACM Area23 entriesComputational ScienceACM Area5 entriesEvolutionary ComputationACM Area12 entriesOperating SystemsACM Area6 entriesQuantum ComputingACM Area2 entriesRoboticsACM Area1 entryTheory of ComputationACM Area1 entrySources1. Wikipedia: Mathematical optimizationtier 2WikipediaMathematical optimization, History sectionQuote, Mathematical optimization, History sectionThe term "linear programming" for certain optimization cases was due to George B. Dantzig, although much of the theory had been introduced by Leonid Kantorovich in 1939.View the SourceComments (0)No comments yet. Be the first to share a thought.Sign in to join the discussion.Reader Challenges (0)No disputes yet. Spotted an error or a better source? Open the first one.Sign in to dispute this or suggest a correction.