Centrum Wiskunde & Informatica

Explaining Constraint Programming Book Chapter

K.R. Apt (Krzysztof)

January 2005
Inequalities Representing Polyhedra Article

Mathematical Programming, 103(1), 35-44.

H. Bosse (Hartwig), M. Grötschel and M. Henk

January 2005
Regular matroid decomposition via signed graphs Article

Journal of Graph Theory, 74-84.

J. Geelen (Jim) and A.M.H. Gerards (Bert)

January 2005
Virtual private network design: a proof of the tree routing conjecture on ring networks In Proceedings

C.A.J. Hurkens (Cor), J.C.M. Keijsper and L. Stougie (Leen)

January 2005
On the equivalence of algebraic approaches to the minimization of forms on the simplex Book Chapter

M. Laurent (Monique), E. de Klerk (Etienne) and P. Parrilo

January 2005
Approximation Algorithms for Unit Disk Graphs In Proceedings

E.J. van Leeuwen (Erik Jan)

January 2005
Maintenance Routing for Train Units: The Transition Model Article

Transportation Science, 39(4), 518-525.

G. Maróti (Gábor) and L.G. Kroon

January 2005
New code upper bounds from the Terwilliger algebra and semidefinite programming Article

IEEE Transactions on Information Theory, 2859-2866.

A. Schrijver (Lex)

January 2005

Previous

Next