Koen M. J. De Bontridder

According to our database, Koen M. J. De Bontridder authored at least 3 papers between 2002 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Local improvement algorithms for a path packing problem: A performance analysis based on linear programming.

Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie

Oper. Res. Lett., 2021

2003

Approximation algorithms for the test cover problem.

Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie

Math. Program., 2003

2002

Branch-and-Bound Algorithms for the Test Cover Problem.

Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie

Proceedings of the Algorithms, 2002