swMATH424MaRDI QIDQ13184FDOQ13184
Author name not available (Why is that?)
Official website: https://doi.org/10.1007/3-540-46004-7_1
Cited In (only showing first 100 items - show all)
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Towards a practical engineering tool for rostering
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- Title not available (Why is that?)
- A review of hyper-heuristics for educational timetabling
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling
- Fairness in academic course timetabling
- Effective learning hyper-heuristics for the course timetabling problem
- Towards objective measures of algorithm performance across instance space
- Variable neighbourhood search: Methods and applications
- A simulated annealing hyper-heuristic methodology for flexible decision support
- A survey of school timetabling research
- Adaptive selection of heuristics for improving exam timetables
- Variable neighbourhood search: methods and applications
- A survey of search methodologies and automated system development for examination timetabling
- A computational study of a cutting plane algorithm for university course timetabling
- An effective hybrid algorithm for university course timetabling
- Case-based heuristic selection for timetabling problems
- Applying evolutionary computation to the school timetabling problem: The Greek case
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
- Hybrid variable neighbourhood approaches to university exam timetabling
- Metaheuristics for solving a multimodal home-healthcare scheduling problem
- Unified encoding for hyper-heuristics with application to bioinformatics
- A step counting hill climbing algorithm applied to university examination timetabling
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences
- Operational research in education
- Memetic techniques for examination timetabling
- Modelling and evaluation issues in nurse rostering
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- A multiobjective framework for heavily constrained examination timetabling problems
- Monte Carlo hyper-heuristics for examination timetabling
- GLOB
- PariTOP
- PYTHIA
- MyPYTHIA
- J-MEANS
- ADATE
- MCS
- EasyLocal++
- JOBSHOP
- QUALEX
- PROXIMUS
- MCQueue
- Spacemap
- METSlib
- AutoGraphiX
- EXTRACOL
- FIRBS
- HyFlex
- Tabu search
- optalgtoolkit
- ZDC
- XHSTT
- NSPLib
- THOR
- HotFrame
- GTSP Instances Library
- GOAL
- Hyperion
- A grasp-knapsack hybrid for a nurse-scheduling problem
- A shift sequence based approach for nurse scheduling and a new benchmark dataset
- A hybrid metaheuristic case-based reasoning system for nurse rostering
- GAUSS
- FES
- METCO
- POPMUSIC
- final exam scheduling
- WorkflowSim
- GraPHedron
- GTSP-LIB
- HIBISCUS
- PARPAP
- GPC++
- NurseScheduler
- Performance Assessment
- Measuring instance difficulty for combinatorial optimization problems
- Generating meta-heuristic optimization code using ADATE
- Learn++
- Adaptive linear combination of heuristic orderings in constructing examination timetables
- Streamlit
- A graph-based hyper-heuristic for educational timetabling problems
- A survey of metaheuristic-based techniques for university timetabling problems
- A harmony search algorithm for university course timetabling
- A new model for automated examination timetabling
- Local search neighbourhoods for dealing with a novel nurse rostering model
- Evolutionary Computation in Combinatorial Optimization
- Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- A review on algorithms for maximum clique problems
- A decomposed metaheuristic approach for a real-world university timetabling problem
- Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
- A university-timetabling problem and its solution using Benders' partitioning---a case study
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Practices in timetabling in higher education institutions: a systematic review
- New feature selection paradigm based on hyper-heuristic technique
- A robust meta-hyper-heuristic approach to hybrid flow-shop scheduling
- Evolution of new algorithms for the binary knapsack problem
This page was built for software: Hyperheuristics
