Yves Caseau, François Laburthe. Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation. In Michel Deza, Reinhardt Euler, Yannis Manoussakis, editors, Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers. Volume 1120 of Lecture Notes in Computer Science, pages 129-149, Springer, 1995.
@inproceedings{CaseauL95,
title = {Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation},
author = {Yves Caseau and François Laburthe},
year = {1995},
tags = {constraints},
researchr = {https://researchr.org/publication/CaseauL95},
cites = {0},
citedby = {0},
pages = {129-149},
booktitle = {Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers},
editor = {Michel Deza and Reinhardt Euler and Yannis Manoussakis},
volume = {1120},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-61576-8},
}