23 citations · 32 across the 11 of their papers we have counts for
5 papers · 1 filter
Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimization
Jiwoo Son, Minsu Kim, Hyeonah Kim +1
This paper proposes Meta-SAGE, a novel approach for improving the scalability of deep reinforcement learning models for combinatorial optimization (CO) tasks. Our method adapts pre…
A Neural Separation Algorithm for the Rounded Capacity Inequalities
Hyeonah Kim, Jinkyoo Park, Changhyun Kwon
The cutting plane method is a key technique for successful branch-and-cut and branch-price-and-cut algorithms that find the exact optimal solutions for various vehicle routing prob…
RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark
Federico Berto, Chuanbo Hua, Junyoung Park +30
Combinatorial optimization (CO) is fundamental to several real-world applications, from logistics and scheduling to hardware design and resource allocation. Deep reinforcement lear…
Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context
Jiwoo Son, Minsu Kim, Sanghyeok Choi +2
Min-max routing problems aim to minimize the maximum tour length among multiple agents by having agents conduct tasks in a cooperative manner. These problems include impactful real…
Symmetric Replay Training: Enhancing Sample Efficiency in Deep Reinforcement Learning for Combinatorial Optimization
Hyeonah Kim, Minsu Kim, Sungsoo Ahn +1
Deep reinforcement learning (DRL) has significantly advanced the field of combinatorial optimization (CO). However, its practicality is hindered by the necessity for a large number…