B. J. Lageweg

According to our database, B. J. Lageweg authored at least 8 papers between 1975 and 2002.

Collaborative distances:

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

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

1990

Multiprocessor scheduling with communication delays.

Bart Veltman, B. J. Lageweg, Jan Karel Lenstra

Parallel Comput., 1990

1983

Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems.

M. A. H. Dempster, Marshall L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan

Math. Oper. Res., 1983

Surrogate duality relaxation for job shop scheduling.

Marshall L. Fisher, B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan

Discret. Appl. Math., 1983

1982

Computer-Aided Complexity Classification of Combinatorial Problems.

B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan

Commun. ACM, 1982

1981

Analytical Evaluation of Hierarchical Planning Systems.

Michael A. H. Dempster, Marshall L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan

Oper. Res., 1981

1978

A General Bounding Scheme for the Permutation Flow-Shop Problem.

B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan

Oper. Res., 1978

1975

Minimizing Total Costs in One-Machine Scheduling.

A. H. G. Rinnooy Kan, B. J. Lageweg, Jan Karel Lenstra

Oper. Res., 1975