scientific article
From MaRDI portal
Publication:2779807
zbMath0982.68512MaRDI QIDQ2779807
Publication date: 15 April 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2079/20790132
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A survey of search methodologies and automated system development for examination timetabling ⋮ Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling ⋮ A multi-objective evolutionary algorithm for examination timetabling ⋮ A step counting hill climbing algorithm applied to university examination timetabling ⋮ Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling ⋮ Case-based heuristic selection for timetabling problems ⋮ Quotient geometric crossovers and redundant encodings ⋮ An Adaptive Flex-Deluge Approach to University Exam Timetabling ⋮ A graph-based hyper-heuristic for educational timetabling problems ⋮ Solving the examination timetabling problem in GPUs ⋮ A particle swarm optimizer for grouping problems ⋮ A survey of metaheuristic-based techniques for university timetabling problems ⋮ A wide-ranging computational comparison of high-performance graph colouring algorithms ⋮ Managing the tabu list length using a fuzzy inference system: an application to examination timetabling ⋮ Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths ⋮ Grouping evolution strategies: an effective approach for grouping problems ⋮ The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution ⋮ A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing ⋮ Graph coloring by multiagent fusion search ⋮ Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
This page was built for publication:
