Copertina

Review Paper of Nature-Based Optimization Algorithms for Medicine Predictor

Fuente: Zenodo

Salvato in:

Dettagli Bibliografici
Autori principali:	Janhvi Guha, Anjali Chouksey, Purvi Khodwe, Bhushan V. Inje
Natura:	Recurso digital
Pubblicazione:	Zenodo 2021
Soggetti:	Artificial Bee Colony Algorithm Firefly Algorithm Nature-based Optimization Algorithms Particle Swarm Optimization Algorithm Whale Optimization Algorithm
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

KQABC Algorithm: A Novel Artificial Bee Colony Algorithm Integrating K-Means Clustering and Q-Learning
di: Cao, Yang, et al.
Pubblicazione: (2025)

A Meta-Optimization Approach to Solve the Set Covering Problem
di: Broderick Crawford
Pubblicazione: (2018)

Dynamic Generation of Test Cases with Metaheuristics
di: Laura Lanzarini
Pubblicazione: (2010)

Firefly optimization technique based test scenario generation and prioritization
di: Vikas Panthi
Pubblicazione: (2018)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
di: Housni, Omar El, et al.
Pubblicazione: (2024)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
di: Sun, Shuo, et al.
Pubblicazione: (2024)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
di: Su, Yuexin, et al.
Pubblicazione: (2026)

The Combinatorial ANT System for Dynamic Combinatorial Optimization Problems
di: Jose Aguilar
Pubblicazione: (2005)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
di: Chen, Yike, et al.
Pubblicazione: (2024)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
di: Xie, Fangzhou
Pubblicazione: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
di: Encz, Koppány István, et al.
Pubblicazione: (2025)

Solving Linear Programs with Fast Online Learning Algorithms
di: Gao, Wenzhi, et al.
Pubblicazione: (2021)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
di: Hunkenschröder, Christoph, et al.
Pubblicazione: (2025)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
di: Blankenburg, Daniel, et al.
Pubblicazione: (2025)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
di: Xu, Pan
Pubblicazione: (2025)

Optimization in Sanger Sequencing
di: Carpente, Luisa, et al.
Pubblicazione: (2024)

Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
di: Brubaker, Kyle, et al.
Pubblicazione: (2025)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
di: Shi, Haoyan, et al.
Pubblicazione: (2024)

Submodular Order Functions and Assortment Optimization
di: Udwani, Rajan
Pubblicazione: (2021)

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
di: Zhai, Jianing, et al.
Pubblicazione: (2019)

Optimizing robotic motion in dynamic manufacturing environments
di: Salawu, Ganiyat Abiodun, et al.
Pubblicazione: (2025)

Extracting Dual Solutions via Primal Optimizers
di: Carmon, Yair, et al.
Pubblicazione: (2024)

Isotropic Noise in Stochastic and Quantum Convex Optimization
di: Marsden, Annie, et al.
Pubblicazione: (2025)

Quasi-Self-Concordant Optimization with Lewis Weights
di: Ene, Alina, et al.
Pubblicazione: (2025)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
di: Adil, Deeksha, et al.
Pubblicazione: (2025)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
di: Chang, Claire, et al.
Pubblicazione: (2026)

Optimized methods for composite optimization: a reduction perspective
di: Bok, Jinho, et al.
Pubblicazione: (2025)

Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
di: Nerem, Robert R., et al.
Pubblicazione: (2024)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
di: Chen, Li, et al.
Pubblicazione: (2025)

When Location Shapes Choice: Placement Optimization of Substitutable Products
di: Housni, Omar El, et al.
Pubblicazione: (2023)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
di: Moeini, Mahdi, et al.
Pubblicazione: (2024)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
di: Kasperski, Adam, et al.
Pubblicazione: (2024)

Generalized Assignment and Knapsack Problems in the Random-Order Model
di: Klimm, Max, et al.
Pubblicazione: (2025)

Radial Isotropic Position via an Implicit Newton's Method
di: Jambulapati, Arun, et al.
Pubblicazione: (2025)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
di: Dvořák, Michal, et al.
Pubblicazione: (2026)

Coordinating Spot and Contract Supply in Freight Marketplaces
di: Kaminsky, Philip, et al.
Pubblicazione: (2026)

Labeling Methods for Partially Ordered Paths
di: Euler, Ricardo, et al.
Pubblicazione: (2023)

Sparse Submodular Function Minimization
di: Graur, Andrei, et al.
Pubblicazione: (2023)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
di: Sergeev, Ivan
Pubblicazione: (2024)

Distributionally Robust Newsvendor on a Metric
di: Foussoul, Ayoub, et al.
Pubblicazione: (2024)