Simulated annealing for the machine reassignment problem
From MaRDI portal
Recommendations
- Fast machine reassignment
- An optimization-based heuristic for the machine reassignment problem
- Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012
- Multi-neighborhood local search optimization for machine reassignment problem
- Machine reassignment problem: the ROADEF/EURO challenge 2012
Cites work
- Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012
- Cooling Schedules for Optimal Annealing
- Heuristics and matheuristics for a real-life machine reassignment problem
- Mersenne twister
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by simulated annealing
- The late acceptance hill-climbing heuristic
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Tuning parameters of large neighborhood search for the machine reassignment problem
- Variable neighborhood search for Google machine reassignment problem
Cited in
(4)
This page was built for publication: Simulated annealing for the machine reassignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338857)