20 results for “Optimization algorithms”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper introduces a general model of genetic algorithms and studies their optimization problems using reinforcement learning.
A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.
This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.
This paper provides new runtime results and experimental investigations for evolutionary multi-objective algorithms on the multi-objective minimum spanning tree problem.
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.
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.
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.
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…
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…
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…
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…
This paper presents three new algorithms for maximizing revenue in the Stackelberg Vertex Cover problem on certain kinds of trees.
This paper proposes a Genetic Algorithm with constraint repair mechanism for optimally allocating educational resources to high school mathematics students under study time constraints.
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…
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…
The paper presents an algorithm for solving linear programming problems in the oracle model with improved time complexity.