ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Optimization algorithms”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.NEcs.AIcs.LGEmpiricalRecentJun 10, 2026

Mathematical perspective on genetic algorithms with optimization guided operators

Anna Brandenberger, Ilan Doron-Arad, Elchanan Mossel

This paper introduces a general model of genetic algorithms and studies their optimization problems using reinforcement learning.

View →
math.OCcs.DMTheoreticalRecentJun 16, 2026

An Adaptive Algorithm for the Approximation of General Linear-Parametric Optimization Problems

Levin Nemesch, Stefan Ruzika, Clemens Thielen, Alina Wittmann

A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.

View →
math.OCcs.CCcs.LGSurveyRecentOct 29, 2026

Stochastic and Noisy Oracles in Smooth Continuous Optimization

Albert S. Berahas, Liyuan Cao, Katya Scheinberg

This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.

View →
cs.NETheoreticalRecentJun 16, 2026

Evolutionary Algorithms and Multi-Objective Minimum Spanning Trees with Limited Distinct Weight Values

Narges Tavassoli Kejani, Andrew M. Sutton, Frank Neumann

This paper provides new runtime results and experimental investigations for evolutionary multi-objective algorithms on the multi-objective minimum spanning tree problem.

View →
cs.NEEmpiricalRecentJul 18, 2026

Hybrid Augmented Lagrangian Method for General Constrained Optimization via Evolutionary Algorithms

Lampros Printzios, Konstantinos Chatzilygeroudis

This paper proposes a Hybrid Augmented Lagrangian (HyAL) method that integrates the constraint-handling strengths of the AL framework with the exploratory power of population-based search.

View →
cs.DMTheoreticalRecentJun 27, 2026

Local Minima in Quadratic-Penalty Relaxations of Binary Linear Programs

Cheng-Han Huang, Yongliang Sun, Chaoyan Huang, Ismail Alkhouri +1 more

The paper establishes conditions for QUBO formulations of combinatorial optimization problems that guarantee valid binary and feasible local minimizers using gradient-based methods.

View →
cs.DScs.AIcs.CCTheoreticalRecentAug 17, 2026

Improving the matrix multiplication exponent with modern optimization and AlphaEvolve

Emilien Dupont, Marvin Eisenberger, Borislav Kozlovskii, Abbas Mehrabian +6 more

The paper improves the optimization problem at the core of the laser method for obtaining matrix multiplication bounds, yielding a new upper bound of ω < 2.371177.

View →
cs.DSTheoreticalRecentJun 26, 2026

Incremental Submodular Maximization: Better Than Greedy

Marcin Bienkowski, Joakim Blikstad, Jarosław Byrka, Martín Costa +2 more

The paper presents an adaptive scaling algorithm with a competitive ratio of 1.373 for incremental submodular maximization under increasing cardinality constraint, improving upon the previous best res…

View →
math.COcs.CCTheoreticalRecentJul 9, 2026

Polynomial Binary Optimization

Endre Boros

The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…

View →
cs.AIcs.SERecentJun 1, 2026

Algorithmic algorithm development with LLMs: A Case Study on LLM-Usage for Contraction Order Optimization in Tensor Networks

Fabian Hoppe, Melven Röhrig-Zöllner, Philipp Knechtges

The paper demonstrates the potential of using LLMs within verifier-guided evolutionary coding agents to develop and improve algorithms, specifically applied to contraction order optimization in tensor…

View →
cs.NEcs.AIcs.DSRecentMay 28, 2026

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems

Benjamin Doerr, Pietro S. Oliveto, John Alasdair Warwicker

This paper introduces a method to automatically determine the optimal learning period ($ au$) for the Random Gradient hyper-heuristic, enabling it to optimally solve Pseudo-Boolean Problems without ma…

View →
cs.DScs.GTTheoreticalRecentJul 17, 2026

Solving Stackelberg Vertex Cover on trees using split and join

Dominik Scheder, Johannes Tantow

This paper presents three new algorithms for maximizing revenue in the Stackelberg Vertex Cover problem on certain kinds of trees.

View →
cs.NEEmpiricalRecentJul 25, 2026

A genetic algorithm for student academic resource allocation

Ana F. Hernández, Andrej Franulic, Fernando Jiménez

This paper proposes a Genetic Algorithm with constraint repair mechanism for optimally allocating educational resources to high school mathematics students under study time constraints.

View →
cs.DScs.LGstat.MLRecentJun 3, 2026

A General Framework for Dynamic Consistent Submodular Maximization

Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard +2 more

The paper develops a general framework for dynamic consistent submodular maximization, achieving constant-factor approximations with sublinear consistency for both cardinality and rank-$k$ matroid con…

View →
cs.NEcs.AIRecentMay 29, 2026

Linear Ordering Problem: Time for a Change

Fabrizio Fagiolo, Marco Baioletti, Valentino Santucci

The paper addresses limitations in the Linear Ordering Problem (LOP) by introducing a novel benchmark suite derived from current economic data and an algorithmic scheme to generate diverse, high-quali…

View →
math.OCcs.DSTheoreticalRecentJun 10, 2026

On finding exact solutions of linear programs in the oracle model

Daniel Dadush, László A. Végh, Giacomo Zambelli

The paper presents an algorithm for solving linear programming problems in the oracle model with improved time complexity.

View →