Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths-Reference-Cited by-同舟云学术

Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths

Published:1991-03 Issue:2 Volume:51 Page:248-258
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Čangalović Mirjana,Schreuder Jan A.M.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference15 articles.

1. Simulated annealing: An introduction;Aarts;Statistica Neerlandica,1989

2. New methods to color the vertices of a graph;Brélaz;Communications of the ACM,1979

3. Some new combinatorial optimization algorithms applied to timetabling problems;Čangalović,1989

4. Approximate colouring algorithms for composite graphs;Clementson;Journal of Operational Research Society,1983

5. Combinatorial optimization problems with soft and hard requirements;Eiselt;Journal of Operation Research Society,1987

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Coloring the Vertices of 9-pt and 27-pt Stencils with Intervals;2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2022-05

2. An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries;Applied Sciences;2022-04-30

3. Organization of work with clients in the COVID-19 emergency conditions using constraint programming;Tehnika;2021

4. An Integer Programming Model for a Complex University Timetabling Problem: A Case Study;Industrial Engineering and Management Systems;2017-03-30

5. A literature review for course scheduling problem;Pamukkale University Journal of Engineering Sciences;2017