Burke E.K.

E.K. Burke

Information about the author E.K. Burke will soon be added to the site.
Found 8 papers in total
Complete and robust no-fit polygon generation for the irregular stock cutting problem
Complete and robust no-fit polygon generation for the irregular stock cutting problem
2007
The no-fit polygon is a construct that can be used between pairs of shapes for fast...
An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
2007
This paper proposes a new memetic evolutionary algorithm to achieve explicit learning...
A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
2007
Neighbourhood search algorithms are often the most effective known approaches for...
A new placement heuristic for the orthogonal stock-cutting problem
A new placement heuristic for the orthogonal stock-cutting problem
2004
This paper presents a new best-fit heuristic for the two-dimensional rectangular...
Multiple-retrieval case-based reasoning for course timetabling problems
Multiple-retrieval case-based reasoning for course timetabling problems
2006
The structured representation of cases by attribute graphs in a case-based reasoning...
A tabu-search hyperheuristic for timetabling and rostering
A tabu-search hyperheuristic for timetabling and rostering
2003
Hyperheuristics can be defined to be heuristics which choose between heuristics in...
The influence of the fitness evaluation method on the performance of multiobjective search algorithms
The influence of the fitness evaluation method on the performance of multiobjective search algorithms
2006
In this paper we are concerned with finding the Pareto optimal front or a good...
Solving examination timetabling problems through adaptation of heuristic orderings
Solving examination timetabling problems through adaptation of heuristic orderings
2004
Heuristic ordering based methods, very similar to those used for graph colouring...
Papers per page: