Deep Learning for Solving Loading, Packing, Routing, and Scheduling Problems
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
MCTS balances exploration and exploitation to effectively navigate large decision spaces.
“The Monte Carlo Tree Search (MCTS) algorithm is a strategic search method that balances exploration and exploitation to effectively navigate large decision spaces [25, 34].”
From Optimizing Neural Network Architecture for Medical Image Segmentation Using Monte Carlo Tree Search (2026) · cites this paper as [34]
Cites
Mastering Atari, Go, chess and shogi by planning with a learned model
Schrittwieser, J., Antonoglou, I., Hubert, T., Simonyan, K., Sifre, L., Schmitt, S., Guez, A., Lockhart, E., Hassabis, D., Graepel, T., et al. (2020) · Nature · doi:10.1038/s41586-020-03051-4 · Cited by 1,214 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Optimizing Neural Network Architecture for Medical Image Segmentation Using Monte Carlo Tree Search
Meng, L., Nie, F., Zhang, Y., & Han, C. (2026) · arXiv · doi:10.48550/arxiv.2602.22361
- Authors
- Elkefi, S., & Layeb, S. B.
- Affiliations
- Stevens Institute of Technology (US)
- Tunis University (TN)
- Corresponding author
- Layeb, Safa Bhar
- Venue
- Handbook of Formal Optimization
- Publisher
- Springer Nature Singapore
- Published
- 2023
- Pages
- 1-19
- OpenAlex
- W4386385019
- Cited by
- 3
- References
- 1
- Citations by year
- 2025: 2 · 2024: 1
- FWCI
- 1.85
- Type
- book chapter
- Language
- en
- Open access
- closed
- Licence
- Locations
- Springer eBooks (publishedVersion)
- Topics
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- deep learning, combinatorial optimization, scheduling problems, packing problems, loading problem, routing problems, Q-learning, policy gradient, reinforcement learning
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
