S Yanai   T F'ujie   
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN 47(2) 96-111 2004年6月 [査読有り]
The dominance test is a bounding operation in branch-and-bound algorithms, where each subproblem is examined whether it can be terminated or not by comparing, implicitly or explicitly, with another subproblem. For a single machine scheduling probl...