Reinforcement learning for combinatorial optimization: a survey
From MaRDI portal
Publication:2669503
DOI10.1016/j.cor.2021.105400OpenAlexW3170112077MaRDI QIDQ2669503
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.03600
combinatorial optimizationreinforcement learningoperations researchpolicy-based methodsvalue-based methods
Related Items
Digital twin-enabled dynamic scheduling with preventive maintenance using a double-layer Q-learning algorithm, Deep policy dynamic programming for vehicle routing problems, Hybrid offline/online optimization for energy management via reinforcement learning, A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment, A reinforced hybrid genetic algorithm for the traveling salesman problem, Literature reviews in operations research: a new taxonomy and a meta review, Machine learning augmented approaches for hub location problems, Adaptive solution prediction for combinatorial optimization, Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness, An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decision diagrams for optimization
- Variable neighborhood search for the maximum clique
- On the hardness of approximating minimum vertex cover
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Lower bounds and reduction procedures for the bin packing problem
- Three-dimensional bin packing problem with variable bin height
- An effective local search for the maximum clique problem
- An analytical model for the container loading problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Learning heuristics for the TSP by policy gradient
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- \({\mathcal Q}\)-learning
- Heuristic algorithms for the three-dimensional bin packing problem
- Exact algorithms for maximum independent set
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Finding near-optimal independent sets at scale
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
- A better approximation ratio for the vertex cover problem
- Integer Programming Formulation of Traveling Salesman Problems
- A Dynamic Programming Approach to Sequencing Problems
- Handbook of Approximation Algorithms and Metaheuristics
- Finding a Maximum Independent Set
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Linear Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Reducibility among Combinatorial Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- A Method for Solving Traveling-Salesman Problems
- Probability and Computing
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- On the Theory of Dynamic Programming
- Solving Combinatorial Problems with Machine Learning Methods
- Combinatorial optimization. Theory and algorithms.
