Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 1062.90026
de Werra, Dominique; Kobler, Daniel
Coloration de graphes: fondements et applications. (French)
[J] RAIRO, Oper. Res. 37, No. 1, 29-66 (2003). ISSN 0399-0559; ISSN 1290-3868/e

Summary: The classical colouring models are well known thanks in large part to their applications to scheduling type problems; we describe the basic concepts of colourings together with a number of variations and generalisations arising from scheduling problems such as the creation of school schedules. Some exact and heuristic algorithms will be presented, and we will sketch solution methods based on tabu search to find approximate solutions to large problems. Finally we will also mention the use of colourings for creating schedules in sports leagues and for computer file transfer problems. This paper is an extended version of {\it D. de Werra} and {\it D. Kobler}, Coloration et ordonnencement chromatique, ORWP 00/04, Ecole Polytechnique Fédérale de Lausanne (2000).

MSC 2000:: *90B35 Scheduling theory
05C15 Chromatic theory of graphs and maps

Keywords: colouring models; scheduling

Cited in: Zbl 1214.05037

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Article Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]