B. J. Lageweg

Publication Activity (10 Years)

Years Active: 1975-2002
Publications (10 Years): 0

Publications

Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie
Branch-and-Bound Algorithms for the Test Cover Problem. ESA (2002)
Bart Veltman, B. J. Lageweg, Jan Karel Lenstra
Multiprocessor scheduling with communication delays. Parallel Comput. 16 (2-3) (1990)
M. A. H. Dempster, M. L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems. Math. Oper. Res. 8 (4) (1983)
M. L. Fisher, B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan
Surrogate duality relaxation for job shop scheduling. Discret. Appl. Math. 5 (1) (1983)
B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Computer-Aided Complexity Classification of Combinatorial Problems. Commun. ACM 25 (11) (1982)
Michael A. H. Dempster, M. L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Analytical Evaluation of Hierarchical Planning Systems. Oper. Res. 29 (4) (1981)
B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
A General Bounding Scheme for the Permutation Flow-Shop Problem. Oper. Res. 26 (1) (1978)
A. H. G. Rinnooy Kan, B. J. Lageweg, Jan Karel Lenstra
Minimizing Total Costs in One-Machine Scheduling. Oper. Res. 23 (5) (1975)