Sequential Predictive Scheduling in Partitioned Data Domains
From MaRDI portal
Publication:4609764
DOI10.1007/978-3-319-59861-1_1zbMath1384.90053OpenAlexW2634386619MaRDI QIDQ4609764
Christian Hinrichs, Michael Sonnenschein, Jörg Bremer, Sönke Martens
Publication date: 26 March 2018
Published in: Recent Advances in Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-59861-1_1
Stochastic scheduling theory in operations research (90B36) Case-oriented studies in operations research (90B90) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)
Cites Work
- Optimization by Simulated Annealing
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- Support vector data description
- Hybrid parallel tempering and simulated annealing method
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Dynamic weighting in Monte Carlo and optimization
- Equation of State Calculations by Fast Computing Machines
- Monte Carlo sampling methods using Markov chains and their applications
This page was built for publication: Sequential Predictive Scheduling in Partitioned Data Domains
