The following pages link to Edmund Kieran Burke (Q1598760):
Displayed 50 items.
- (Q222053) (redirect page) (← links)
- Unified encoding for hyper-heuristics with application to bioinformatics (Q301251) (← links)
- (Q319662) (redirect page) (← links)
- Surgical scheduling with simultaneous employment of specialised human resources (Q319663) (← links)
- A multi-agent based cooperative approach to scheduling and routing (Q323308) (← links)
- A branch and bound algorithm for the cyclic job-shop problem with transportation (Q339670) (← links)
- Modelling and solving generalised operational surgery scheduling problems (Q342152) (← links)
- An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences (Q367628) (← links)
- A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
- A space-indexed formulation of packing boxes into a larger box (Q433833) (← links)
- A mixed integer programming model for the cyclic job-shop problem with transportation (Q442206) (← links)
- A constructive approach to examination timetabling based on adaptive decomposition and ordering (Q475165) (← links)
- Adaptive selection of heuristics for improving exam timetables (Q475182) (← links)
- A more realistic approach for airport ground movement optimisation with stand holding (Q490362) (← links)
- An analysis of constructive algorithms for the airport baggage sorting station assignment problem (Q490384) (← links)
- Personnel scheduling: models and complexity (Q541689) (← links)
- Solving examination timetabling problems through adaption of heuristic orderings (Q596455) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- The simplified partial digest problem: approximation and a graph-theoretic model (Q621677) (← links)
- A hybrid placement strategy for the three-dimensional strip packing problem (Q621967) (← links)
- A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) (← links)
- University space planning and space-type profiles (Q707692) (← links)
- On-line decision support for take-off runway scheduling with uncertain taxi times at London heathrow airport (Q835619) (← links)
- Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
- Case-based heuristic selection for timetabling problems (Q880536) (← links)
- Selected papers from the Dagstuhl Workshop (Q880582) (← links)
- Fuzzy job shop scheduling with lot-sizing (Q940894) (← links)
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables (Q958431) (← links)
- On the approximability of the simplified partial digest problem (Q967421) (← links)
- Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems (Q1026761) (← links)
- Mathematical justification of a heuristic for statistical correlation of real-life time series (Q1027625) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems (Q1046124) (← links)
- A multi-objective approach for robust airline scheduling (Q1046693) (← links)
- (Q1337560) (redirect page) (← links)
- Unification in partially commutative semigroups (Q1337561) (← links)
- Recent research directions in automated timetabling (Q1598761) (← links)
- Breakout local search for the multi-objective gate allocation problem (Q1652056) (← links)
- A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways (Q1652574) (← links)
- The late acceptance hill-climbing heuristic (Q1698884) (← links)
- A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem (Q1744527) (← links)
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics (Q1753518) (← links)
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem (Q1753627) (← links)
- Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)
- A Pareto-based search methodology for multi-objective nurse scheduling (Q1761798) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
- Linear combinations of heuristics for examination timetabling (Q1761893) (← links)