ScholarGate
Pembantu

Pengaturcaraan matematik

58 kaedah dalam keluarga ini.

Sorotan

Algoritma Pengoptimuman Burung Nasar AfrikaThe African Vultures Optimization Algorithm (AVOA) is a metaheuristic algorithm introduced by Moghdani and Salimifard in 2020, inspired by the search and scavenging behavior of AfrPengaturcaraan Dinamik Berasaskan EjenAgent-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 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 oPengoptima AquilaThe 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 eagAlgoritma Pengoptimuman AritmetikThe 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. Pengaturcaraan Linear1947by George B. Dantzig
  2. Pengaturcaraan Linear Stokastik1955by George B. Dantzig
  3. Pengaturcaraan Dinamik1957by Richard Bellman
  4. Pengaturcaraan Dinamik Stokastik1957by Bellman, R.; formalized for stochastic settings by Puterman, M. L.
  5. Pengaturcaraan Integer1958by Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960)
  6. Pengaturcaraan Integer Campuran1958–1960by Ralph Gomory (branch-and-bound cuts, 1958); Land & Doig (branch-and-bound, 1960)
  7. Pengoptimuman Bayesian1975 (foundational); 2012 (ML standard)by Mockus (1975); popularised for ML by Snoek, Larochelle & Adams (2012)
  8. Algoritma Kulat Lendir2020by Shimin Li
all methods on this shelf ↓

Semua kaedah 58

Algoritma Pengoptimuman Burung Nasar AfrikaPengaturcaraan Dinamik Berasaskan EjenAgent-Based Goal ProgrammingAgent-Based Integer ProgrammingPengoptima AquilaAlgoritma Pengoptimuman AritmetikPengaturcaraan Dinamik BayesianPengaturcaraan Matlamat BayesianPengaturcaraan Integer BayesianPengaturcaraan Linear BayesianPengaturcaraan Integer Campuran BayesianPengoptimuman BayesianPengoptimuman Dua Aras (Pemimpin-Pengikut)Branch and BoundPengaturcaraan BatasanOptimisasi KonveksPengaturcaraan Dinamik DeterministikPengaturcaraan Integer Peng DeterministikLinear Programming DeterministikPemrograman Campuran-Integer DeterministikDwarf Mongoose OptimizationPengaturcaraan DinamikEvolutionary Strategy (CMA-ES)Persamaan Hamilton-Jacobi-BellmanPengoptimuman Helang HarrisAlgoritma Musang MaduPengaturcaraan IntegerJellyfish Search OptimizerPengaturcaraan LinearPengaturcaraan Integer CampuranPengaturcaraan Dinamik Multi-ObjektifPengaturcaraan Matlamat Pelbagai ObjektifPengaturcaraan Linear Multi-Objektif (MOLP)Pengaturcaraan Integer Campuran Berbilang ObjektifPengaturcaraan Tak LinearPolicy Scenario Dynamic ProgrammingPengaturcaraan Matlamat Skenario DasarPengaturcaraan Integer Senario PolisiPengaturcaraan Kuadratik (QP)Pengaturcaraan Matlamat TeguhRobust Integer ProgrammingPengaturcaraan Linear RobustPengaturcaraan Integer Bercampur TeguhPengoptimuman TeguhPengoptimum Runge KuttaKaedah SimplexAlgoritma Kulat LendirPengaturcaraan Dinamik StokastikPengaturcaraan Matlamat StokastikPengaturcaraan Integer StokastikPengaturcaraan Linear StokastikPengaturcaraan Integer Bercampur StokastikPengoptimuman StokastikOptimisasi Berasaskan SurogatKomitmen UnitPencarian Jiran S variable (VNS)Masalah Penghalaan Kenderaan (VRP)Algoritma Pengoptimuman Paus (WOA)