ENTITY
NP-hard combinatorial optimization problems
NP-hard combinatorial optimization problems
PulseAugur coverage of NP-hard combinatorial optimization problems — every cluster mentioning NP-hard combinatorial optimization problems across labs, papers, and developer communities, ranked by signal.
Total · 30d
1
2 over 90d
Releases · 30d
0
0 over 90d
Papers · 30d
1
2 over 90d
TIER MIX · 90D
TOPICS
SENTIMENT · 30D
1 day(s) with sentiment data
RECENT · PAGE 1/1 · 2 TOTAL
-
Ballad algorithm optimizes LLM use for heuristic discovery
A new bandit-based algorithm called Ballad has been developed to optimize the use of multiple Large Language Models (LLMs) in automated heuristic discovery. Researchers found that larger, more expensive LLMs do not cons…
-
LLMs power new directed graph framework for automated algorithm design
Researchers have developed DGA$_2$D, a novel framework for automated algorithm design that leverages large language models (LLMs) to tackle complex NP-hard combinatorial optimization problems. Unlike previous methods th…