Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
From MaRDI portal
Publication:2108169
Recommendations
- On Monte Carlo tree search for weighted vertex coloring
- Monte Carlo tree search with robust exploration
- Optimistic Monte Carlo tree search with sampled information relaxation dual bounds
- Using evaluation functions in Monte-Carlo tree search
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.
Cites work
- A m‐parallel crane scheduling problem with a non‐crossing constraint
- A biased random-key genetic algorithm for the container pre-marshalling problem
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- A generalized classification scheme for crane scheduling with interference
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A New Algorithm for the 0-1 Knapsack Problem
- A new class of hard problem instances for the 0-1 knapsack problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- Amazons Discover Monte-Carlo
- An expanding-core algorithm for the exact 0-1 knapsack problem
- An Optimal Computing Budget Allocation Tree Policy for Monte Carlo Tree Search
- Approximate the scheduling of quay cranes with non-crossing constraints
- Asymptotically efficient adaptive allocation rules
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Crane scheduling with non-crossing constraint
- Discrete-variable extremum problems
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Exact solution of the robust knapsack problem
- Fast Approximation Algorithms for Knapsack Problems
- Finite-time analysis of the multiarmed bandit problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Job Shop Scheduling by Simulated Annealing
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Modeling and solution of the joint quay crane and truck scheduling problem
- Monte-Carlo Tree Search Solver
- On Monte Carlo tree search for weighted vertex coloring
- PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
- Pruning playouts in Monte Carlo tree search for the game of Havannah
- Reinforcement learning. An introduction
- Search Methodologies
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- The number of legal Go positions
- Tolerance analysis for 0-1 knapsack problems
- Where are the hard knapsack problems?
Cited in
(6)- On Monte Carlo tree search for weighted vertex coloring
- Monte Carlo tree search for automatic differential characteristics search: application to SPECK
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
- Expectation analysis for bounding solutions of the 0-1 knapsack problem
- Operations research, machine learning, and integrated techniques for decision problems in the Seaside area of container terminals
- Solving air-ground collaborative scheduling problem in airports: a model-based Monte Carlo tree search approach
This page was built for publication: Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108169)
