ScholarGate
Assistent

Matematisk programmering

58 metoder i denne familien.

Utvalgte

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-based dynamic programmingAgent-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-basert målprogrammeringAgent-Based Goal Programming (ABGP) integrates agent-based simulation with goal programming optimization to model systems where multiple autonomous decision-makers pursue competingAgent-Based Integer ProgrammingAgent-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 optimaliseringsalgoritmeThe 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. Linear Programming1947by George B. Dantzig
  2. Stokastisk lineær programmering1955by George B. Dantzig
  3. Dynamisk programmering1957by Richard Bellman
  4. Stochastic Dynamic Programming1957by Bellman, R.; formalized for stochastic settings by Puterman, M. L.
  5. Heltallsprogrammering1958by Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960)
  6. Heltallsprogrammering1958–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. Slimsoppalgoritmen2020by Shimin Li
all methods on this shelf ↓

Alle metoder 58

African Vultures Optimization AlgorithmAgent-based dynamic programmingAgent-basert målprogrammeringAgent-Based Integer ProgrammingAquila OptimizerAritmetisk optimaliseringsalgoritmeBayesiansk dynamisk programmeringBayesiansk målprogrammeringBayesiansk heltallsprogrammeringBayesiansk lineærprogrammeringBayesiansk blandet heltallsprogrammeringBayesiansk optimeringTohåndsoptimalisering (Leder-Følge)Branch and BoundConstraint ProgrammingKonveks optimeringDeterministisk Dynamisk ProgrammeringDeterministisk heltallsprogrammeringDeterministisk Lineær Programmering – Klassisk LP med sikre parametereDeterministisk heltallsprogrammering – Eksakt optimering med faste parametereDvergichneumonoptimaliseringDynamisk programmeringEvolusjonsstrategi (CMA-ES)Hamilton-Jacobi-Bellman-ligningenHarris Hawks OptimizationHoney Badger AlgorithmHeltallsprogrammeringJellyfish Search OptimizerLinear ProgrammingHeltallsprogrammeringMulti-Objective Dynamic ProgrammingMulti-Objective Goal ProgrammingMulti-objektiv lineær programmering (MOLP)Multi-Objective Mixed-Integer ProgrammingIkke-lineær programmeringPolicy Scenario Dynamic ProgrammingPolicy Scenario Goal ProgrammingPolicy Scenario Integer ProgrammingKvadratisk programmering (QP)Robust MålprogrammeringRobust Integer ProgrammingRobust Lineær ProgrammeringRobust Mixed-Integer ProgrammingRobust optimeringRunge Kutta OptimizerSimplexmetodenSlimsoppalgoritmenStochastic Dynamic ProgrammingStokastisk målprogrammeringStokastisk heltallsprogrammeringStokastisk lineær programmeringStokastisk heltallsprogrammeringStokastisk optimeringSurrogate-basert optimeringEnhetsforpliktelseVariabel nabosøk (VNS)Kjøretøyrutingsproblemet (VRP)Hvaloptimaliseringsalgoritmen (WOA)