Publisher
Springer Science and Business Media LLC
Reference11 articles.
1. Arbib, C., Flammini, M., & Nardelli, E. (2000). How to survive while visiting a graph. Discrete applied mathematics, 99(1–3), 279–293.
2. Fertin, G., Rusu, I., & Vialette, S. (2015). Obtaining a triangular matrix by independent row-column permutations. International symposium on algorithms and computation (pp. 165–175). Springer.
3. Garey, M. R., & Johnson, D. S. (2002). Computers and intractability (Vol. 29). W.H. Freeman.
4. Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117–129.
5. Hadj Salem, K., Kieffer, Y., & Mancini, M. (2018). Meeting the challenges of optimized memory management in embedded vision systems using operations research (pp. 177–205). Springer International Publishing.