The following pages link to Edmund Kieran Burke (Q1598760):
Displayed 50 items.
- A fuzzy sets based generalization of contact maps for the overlap of protein structures (Q1776513) (← links)
- A new model and a hyper-heuristic approach for two-dimensional shelf space allocation (Q1942009) (← links)
- A shift sequence based approach for nurse scheduling and a new benchmark dataset (Q1959177) (← links)
- Recent advances in selection hyper-heuristics (Q2183846) (← links)
- A cutoff time strategy based on the coupon collector's problem (Q2184095) (← links)
- Adaptive linear combination of heuristic orderings in constructing examination timetables (Q2255942) (← links)
- Multiobjective evolutionary algorithms for strategic deployment of resources in operational units (Q2282564) (← links)
- Journal of scheduling (2020) (Q2305015) (← links)
- Comments on: ``An overview of curriculum-based course timetabling'' (Q2355017) (← links)
- A graph-based hyper-heuristic for educational timetabling problems (Q2432892) (← links)
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling (Q2460072) (← links)
- The state of the art of nurse rostering (Q2464436) (← links)
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem (Q2470097) (← links)
- Scheduling malleable tasks with interdependent processing rates: comments and observations (Q2476250) (← links)
- The speciating Island model: an alternative parallel evolutionary algorithm (Q2498693) (← links)
- New approaches to nurse rostering benchmark instances (Q2514811) (← links)
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems (Q2569035) (← links)
- A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem (Q2668655) (← links)
- (Q2770503) (← links)
- (Q2779805) (← links)
- (Q2780654) (← links)
- (Q2781959) (← links)
- Data Structures for Higher-Dimensional Rectilinear Packing (Q2815459) (← links)
- Asynchronous Cooperative Local Search for the Office-Space-Allocation Problem (Q2892369) (← links)
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition (Q2899043) (← links)
- A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem (Q2899099) (← links)
- A Component-Based Heuristic Search Method with Evolutionary Eliminations for Hospital Personnel Scheduling (Q2901079) (← links)
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem (Q2901082) (← links)
- An Adaptive Flex-Deluge Approach to University Exam Timetabling (Q2960370) (← links)
- Irregular Packing Using the Line and Arc No-Fit Polygon (Q3098287) (← links)
- A time-predefined approach to course timetabling (Q3155573) (← links)
- Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems (Q3161783) (← links)
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem (Q3392005) (← links)
- Towards improving the utilization of university teaching space (Q3394046) (← links)
- Exploring Hyper-heuristic Methodologies with Genetic Programming (Q3401729) (← links)
- (Q3442353) (← links)
- (Q3500150) (← links)
- An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering (Q3518803) (← links)
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem (Q3518833) (← links)
- (Q3525424) (← links)
- Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation (Q3612204) (← links)
- The Undecidability of the Unification Problem for Nilpotent Groups of Class ⩾ 5 (Q4289356) (← links)
- (Q4301157) (← links)
- (Q4449797) (← links)
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology (Q4452905) (← links)
- (Q4737874) (← links)
- (Q4817405) (← links)
- Unification for nilpotent groups of class 2 (Q4840300) (← links)
- Multiple-retrieval case-based reasoning for course timetabling problems (Q5200786) (← links)
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem (Q5321741) (← links)