Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
From MaRDI portal
Publication:2108169
DOI10.1016/j.cor.2022.106070OpenAlexW4308310692MaRDI QIDQ2108169
Pieter Leyman, Jorik Jooken, Tony Wauters, Patrick de Causmaecker
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.11523
combinatorial optimizationMonte Carlo tree search0-1 knapsack problemquay crane scheduling problem with non-crossing constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- Exact solution of the robust knapsack problem
- A biased random-key genetic algorithm for the container pre-marshalling problem
- Asymptotically efficient adaptive allocation rules
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- A generalized classification scheme for crane scheduling with interference
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Approximate the scheduling of quay cranes with non-crossing constraints
- Tolerance analysis for 0-1 knapsack problems
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Where are the hard knapsack problems?
- Pruning playouts in Monte Carlo tree search for the game of Havannah
- The number of legal Go positions
- A new class of hard problem instances for the 0-1 knapsack problem
- On Monte Carlo tree search for weighted vertex coloring
- Modeling and solution of the joint quay crane and truck scheduling problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Search Methodologies
- Crane scheduling with non-crossing constraint
- Amazons Discover Monte-Carlo
- Monte-Carlo Tree Search Solver
- A New Algorithm for the 0-1 Knapsack Problem
- Fast Approximation Algorithms for Knapsack Problems
- Job Shop Scheduling by Simulated Annealing
- A Minimal Algorithm for the 0-1 Knapsack Problem
- An Optimal Computing Budget Allocation Tree Policy for Monte Carlo Tree Search
- Discrete-Variable Extremum Problems
- A m‐parallel crane scheduling problem with a non‐crossing constraint
- PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
- Finite-time analysis of the multiarmed bandit problem
