1984 search results - page 1 / 397 » The colourful feasibility problem |
DAM
2008
13 years 5 months ago
2008
We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by B
FCT
2009
Springer
13 years 12 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
COCOA
2009
Springer
13 years 12 months ago
2009
Springer
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...
APCHI
2004
IEEE
13 years 9 months ago
2004
IEEE
We survey a number of tools that have been developed for generating sets of colours according to commonly accepted rules for colour harmony. Informal manual techniques for generati...
DM
2002
13 years 5 months ago
2002
A basic problem in the design of mobile telephone networks is to assign sets of radio frequency bands (colours) to transmitters (vertices) to avoid interference. Often the transmi...