Search
Now showing items 1-3 of 3
(Journal article / Tidsskriftartikkel / SubmittedVersion, 2009)
We consider a combinatorial problem motivated by a special simplified timetabling problem for subway networks. Mathematically the problem is to find (pairwise) disjoint congruence classes modulo certain given integers; ...
(Journal article / Tidsskriftartikkel / AcceptedVersion; Peer reviewed, 2006)
Starting with a problem in wireless telecommunication, we are led to study the multiple knapsack problem with assignment restrictions. This problem is NP-hard. We consider special cases and their computational complexity. ...
(Journal article / Tidsskriftartikkel / AcceptedVersion; Peer reviewed, 2004)
An Elsevier Open Archive article.
NOTICE: this is the author’s version of a work that was accepted for publication in Linear Algebra and its Applications. Changes resulting from the publishing process, such as peer ...