Similar Search Results

On the computational complexity of (Maximum) Shift Class Scheduling

Kolen, A.W.J.; Kroon, L.G. - In: European journal of operational research : EJOR 64 (1993) 1, pp. 138

Persistent link: https://www.econbiz.de/10006689564

Solving frequency assignment problems via tree-decomposition

Koster, A.M.C.A.; Hoesel, S.P.M. van; Kolen, A.W.J. - Maastricht : METEOR, Maastricht Research School of … - 1999

In this paper we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm which solves FAPs based on this tree decomposition. We show...

Persistent link: https://www.econbiz.de/10005304977

The round-trip p-center and covering problem on a tree

Kolen, Antoon W. J. - 1985

Persistent link: https://www.econbiz.de/10000716534

Polyhedral combinatorics in combinatorial optimization

Gerards, Albertus M. - 1985

Persistent link: https://www.econbiz.de/10000717885

Case-Oriented Papers - Solving a bi-criterion cutting stock problem with open-ended demand: A case study

Kolen, A.W.J.; Spieksma, F.C.R. - In: Journal of the Operational Research Society : OR 51 (2000) 11, pp. 1238-1247

Persistent link: https://www.econbiz.de/10006043197