ScholarGate
Assistent

Matematisk programmering

58 metoder i denna familj.

I urval

African Vultures Optimization AlgorithmThe African Vultures Optimization Algorithm (AVOA) is a metaheuristic algorithm introduced by Moghdani and Salimifard in 2020, inspired by the search and scavenging behavior of AfrAgent-baserad dynamisk programmeringAgent-based dynamic programming (ABDP) embeds Bellman's dynamic programming framework within individual agents of an agent-based model, enabling each agent to solve sequential, mulAgent-Based Goal ProgrammingAgent-Based Goal Programming (ABGP) integrates agent-based simulation with goal programming optimization to model systems where multiple autonomous decision-makers pursue competingAgentbaserad heltalsoptimeringAgent-Based Integer Programming (ABIP) couples the behavioral richness of agent-based modeling with the combinatorial rigor of integer programming. Individual agents pursue local oAquila OptimizerThe Aquila Optimizer (AO) is a nature-inspired metaheuristic algorithm presented by Abualigah et al. in 2021, modeled after the hunting behavior and sensory abilities of golden eagAritmetisk optimeringsalgoritmThe Arithmetic Optimization Algorithm (AOA) is a metaheuristic optimization approach introduced by Abualigah et al. in 2020 that leverages mathematical operators (multiplication, d

Reading path

This topic's most-referenced foundational methods, in the order they were developed — a place to start if you're new here.

  1. Linjärprogrammering1947by George B. Dantzig
  2. Stokastisk linjär programmering1955by George B. Dantzig
  3. Dynamisk programmering1957by Richard Bellman
  4. Stokastisk dynamisk programmering1957by Bellman, R.; formalized for stochastic settings by Puterman, M. L.
  5. Heltalsprogrammering1958by Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960)
  6. Heltalsoptimering1958–1960by Ralph Gomory (branch-and-bound cuts, 1958); Land & Doig (branch-and-bound, 1960)
  7. Bayesiansk optimering1975 (foundational); 2012 (ML standard)by Mockus (1975); popularised for ML by Snoek, Larochelle & Adams (2012)
  8. Slime Mould Algorithm2020by Shimin Li
all methods on this shelf ↓

Alla metoder 58

African Vultures Optimization AlgorithmAgent-baserad dynamisk programmeringAgent-Based Goal ProgrammingAgentbaserad heltalsoptimeringAquila OptimizerAritmetisk optimeringsalgoritmBayesian Dynamic ProgrammingBayesianskt målprogrammeringsproblemBayesian Integer ProgrammingBayesiansk linjärprogrammeringBayesian Mixed-Integer ProgrammingBayesiansk optimeringDubbeloptimeringsproblem (ledare-följare)Branch and BoundConstraint ProgrammingKonvex optimeringDeterministic Dynamic ProgrammingDeterministisk heltalsoptimeringDeterministisk linjär programmering – Klassisk LP med säkra parametrarDeterministic Mixed-Integer ProgrammingDvärgmungooptimeringDynamisk programmeringEvolutionary Strategy (CMA-ES)Hamilton-Jacobi-Bellman-ekvationenHarris Hawks OptimizationAlgoritm för honungsgrävlingenHeltalsprogrammeringJellyfish Search OptimizerLinjärprogrammeringHeltalsoptimeringMulti-Objective Dynamic ProgrammingMålprogrammering med flera målFlerobjektiv linjär programmering (MOLP)Flerkriterieoptimering med blandade heltal (MO-MIP)Icke-linjär programmeringPolicy Scenario Dynamic ProgrammingPolicy Scenario Goal ProgrammingPolicy Scenario Integer ProgrammingKvadratisk programmering (QP)Robust målprogrammeringRobust Integer ProgrammingRobust linjärprogrammeringRobust Mixed-Integer ProgrammingRobust optimeringRunge Kutta OptimizerSimplexmetodenSlime Mould AlgorithmStokastisk dynamisk programmeringStokastisk målprogrammeringStokastisk heltalsoptimeringStokastisk linjär programmeringStokastisk Mixed-Integer ProgrammingStokastisk optimeringOptimering baserad på surrogatmodellerUnit CommitmentVariable Neighborhood Search (VNS)Fordonroutingproblem (VRP)Whale Optimization Algorithm (WOA)