Home›Optimization Algorithm›Design TechniqueBrowse ByDesign TechniqueThis dimension groups algorithms by the design technique they use, divide and conquer, dynamic programming or greedy choice. Wikipedia notes that "advanced algorithms may utilize loops and involve many conditionals that decide the next step based on the inputs provided," a structural choice that defines the technique behind the algorithm. Browsing by design technique keeps algorithms built the same way grouped together.FactsDesign TechniqueSourcesComments (0)Reader Challenges (0)FactsComparisonEra of EmergenceWell-attested1939 CE 1Design TechniqueFilter Results8 entriesCategoryAllApproximation Algorithms (3)Combinatorial Optimization Design Strategies (2)Constraint-Based Planning and Generation Algorithms (1)Gradient and Quasi-Newton Optimization Methods (1)Metaheuristic Optimization Algorithms (3)Numerical Search and Equilibrium Methods (2)Quantum Computing and Information (1)Root-Finding and Optimization (1)Scheduling Algorithms (1)Time ComplexityAllExponential Time -- O(2^n) (1)Linear Time -- O(n) (1)Polynomial Time -- O(n^k) (2)Quadratic Time -- O(n^2) (3)Invented ByAllBruce Donald (1)Hidetoshi Nishimori (1)Marco Dorigo (2)Tadashi Kadowaki (1)GroupAllApproximation Algorithms (3)Combinatorial Optimization Design Strategies (2)Constraint-Based Planning and Generation Algorithms (1)Gradient and Quasi-Newton Optimization Methods (1)Metaheuristic Optimization Algorithms (3)Numerical Search and Equilibrium Methods (2)Quantum Computing and Information (1)Root-Finding and Optimization (1)Scheduling Algorithms (1)Credited ToAllBruce Donald (1)Hidetoshi Nishimori (1)Marco Dorigo (2)Tadashi Kadowaki (1)ACM AreaAllAlgorithms and Complexity Theory (5)Computational Science (3)Evolutionary Computation (3)Operating Systems (1)Quantum Computing (1)Robotics (1)Origin YearAll1952 (1)1960 (1)1983 (1)Show ResultsBrowseCompareApproximation AlgorithmsDesign Technique30 entriesBranch and BoundDesign Technique3 entriesDynamic ProgrammingDesign Technique2 entriesGreedy MethodDesign Technique6 entriesHeuristicsDesign Technique29 entriesIterative RefinementDesign Technique2 entriesRandomized AlgorithmsDesign Technique1 entrySimulated AnnealingDesign Technique1 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.