Ensemble machine learning-based stopping rule for greedy randomized adaptive search procedure
From MaRDI portal
Cites work
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
- A note on solving large p-median problems
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
- A robust possibilistic programming framework for designing an organ transplant supply chain under uncertainty
- An algorithm for set covering problem
- Bayesian stopping rules for greedy randomized procedures
- Bayesian stopping rules for multistart global optimization methods
- Boosting ant colony optimization via solution prediction and machine learning
- Confidence in heuristic solutions?
- Configurable intelligent optimization algorithm. Design and practice in manufacturing
- Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm
- Experiments with LAGRASP heuristic for set \(k\)-covering
- Greedy randomized adaptive search procedures
- Least squares quantization in PCM
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Parallel genetic algorithms. Theory and real world applications
- Probabilistic stopping rules for GRASP heuristics and extensions
- QAPLIB - a quadratic assignment problem library
- Random forests
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Scikit-learn: machine learning in Python
- Statistical comparisons of classifiers over multiple data sets
- The rainbow Steiner tree problem
This page was built for publication: Ensemble machine learning-based stopping rule for greedy randomized adaptive search procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227128)
