Author:
Simonin G.,Darties B.,Giroudeau R.,König J.-C.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference23 articles.
1. Ahr, D., Békési, J., Galambos, G., Oswald, M., & Reinelt, G. (2004). An exact algorithm for scheduling identical coupled-tasks. Mathematical Methods of Operations Research, 59(11), 193–203.
2. Arikati, R. S., & Rangan, P. C. (1990). Linear algorithm for optimal path cover problem on interval graphs. Information Processing Letters, 35(3), 149–153.
3. Berman, P., & Karpinski, M. (2006). 8/7-approximation algorithm for (1,2)-TSP. In SODA ’06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (pp. 641–648). New York: ACM.
4. Blażewicz, J., Ecker, K., Kis, T., Potts, C. N., Tanas, M., & Whitehead, J. (2009). Scheduling of coupled tasks with unit processing times. Technical report, Poznan University of Technology.
5. Boesch, F. T., Chen, S., & McHugh, B. (1974). On covering the points of a graph with point-disjoint paths. Graphs and Combinatorics, 406, 201–212.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献