Author:
Shang Lei,T’Kindt Vincent,Della Croce Federico
Funder
Ministero dell’Istruzione, dell’Università e della Ricerca
Subject
Management Science and Operations Research,Modelling and Simulation,General Computer Science
Reference39 articles.
1. A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates;Baptiste;Eur. J. Oper. Res.,2004
2. Conflict-driven clause learning sat solvers. Handbook of Satisfiability;Biere;Front. Artif. Intell. Appl.,2009
3. The one-machine sequencing problem;Carlier;Eur. J. Oper. Res.,1982
4. A branch-and-bound algorithm to minimize total flow time with unequal release dates;Chu;Naval Research Logistics (NRL),1992
5. Resolution search;Chvatal;Discrete Appl. Math.,1997
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献