Skip to content

Learning Heuristics for Minimum Latency Problem with RL and GNN

· 0 citations · 22 references

TL;DR

It is shown how RL can be applied to the Minimum Latency Problem by using a graph attention network to encode a stochastic policy for constructively building partial paths, yielding solutions which are comparable to state-of-the-art, hand-engineered meth-ods.

View source

Similar papers

Jul 2026

On the Runtime Analysis of Reinforcement Learning Hyper-Heuristics

It is rigorously proved that with appropriate parameter values RLHH equipped with two random local search operators, RLS_1 and RLS_2 optimises the LeadingOnes benchmark function in the best possible expected runtime achievable with the two operators up to lower order terms.

P. S. Oliveto, Zhen-Yu Wang, Peizhou Wu et al. · 0 citations

Reinforcement Learning for Code Optimization

This work makes execution time learnable through three stages: how code is tested, by building DMC-Optim with large optimization tests and a calibrated sandbox; how speed is turned into reward, by composing correctness and speed in the RL environment and using an offline simulator to predict the most promising configur...

Pierre Chambon, Kun-Hao Zheng, Juliette Decugis et al. · 0 citations
Preprint Jul 2026

SEER: Supervised Learning to Control Energetic Reasoning

One of the main strengths of Constraint Programming is the ability to reduce the search space via propagation. However, propagation is a double-edged sword, with more pruning power coming at the price of larger computation time. For each problem constraint, the best propagator depends on the specific instance and may c...

Sascha Van Cauwelaert, M. Lombardi, P. Schaus · 0 citations
Preprint Aug 2026

Learning Early-to-Final Solution Consistency for MILP Acceleration

This paper finds that solutions produced at the early search stage of MILP solvers are often structurally close to the solutions found after full-budget search, and proposes a new solver-informed paradigm that shifts the learning target from variable assignment to early-to-final consistency.

Guanli Li, Chengrui Gao, Chenguang Wang et al. · 0 citations
Review Open access Jul 2026

Deep Reinforcement Learning for Combinatorial Optimization Problems: A Challenge-Driven Methodology and Systematic Review

This work proposes a unified challenge-driven framework consisting of four core components: an environment, a state–action–reward mechanism, a solver, and an evaluation module, and conducts a systematic review of approximately 300 recent studies, mapping the evolution of challenges and the progress made in addressing t...

Shengyun Wei, Chui-Bing Huang, Zhen-Yi Wang et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.