References in zbMATH (referenced in 244 articles )

Showing results 1 to 20 of 244.
Sorted by year (citations)

1 2 3 ... 11 12 13 next

  1. Arbex Valle, Cristiano; Beasley, John E.: Order batching using an approximation for the distance travelled by pickers (2020)
  2. Ehrmann, Silvia; Gries, Sebastian; Schweitzer, Marc Alexander: Generalization of algebraic multiscale to algebraic multigrid (2020)
  3. Jukna, Stasys; Seiwert, Hannes: Approximation limitations of pure dynamic programming (2020)
  4. Jukna, Stasys; Seiwert, Hannes: Sorting can exponentially speed up pure dynamic programming (2020)
  5. Kobayashi, Kei; Wynn, Henry P.: Empirical geodesic graphs and CAT((k)) metrics for data analysis (2020)
  6. Mankowski, Michal; Moshkov, Mikhail: Dynamic programming bi-criteria combinatorial optimization (2020)
  7. Sheng, Yuhong; Mei, Xuehui: Uncertain random shortest path problem (2020)
  8. Shvydun, Sergey: Computational complexity of SRIC and LRIC indices (2020)
  9. Tang, Fengqin; Wang, Chunning; Su, Jinxia; Wang, Yuanyuan: Spectral clustering-based community detection using graph distance and node attributes (2020)
  10. Thraves Caro, Christopher; Doncel, Josu; Brun, Olivier: Optimal path discovery problem with homogeneous knowledge (2020)
  11. Chawdhary, Aziem; Robbins, Ed; King, Andy: Incrementally closing octagons (2019)
  12. Chen, Lin; Peng, Jin; Ralescu, Dan A.: Uncertain vertex coloring problem (2019)
  13. Danda, Sravan; Challa, Aditya; Sagar, B. S. Daya; Najman, Laurent: Some theoretical links between shortest path filters and minimum spanning tree filters (2019)
  14. de Armas, Jesica; Keenan, Peter; Juan, Angel A.; McGarraghy, Seán: Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (2019)
  15. Etling, Tommy; Herzog, Roland; Siebenborn, Martin: Optimum experimental design for interface identification problems (2019)
  16. Ferraro, Maria Brigida; Giordani, Paolo: A review and proposal of (fuzzy) clustering for nonlinearly separable data (2019)
  17. Halman, Nir; Kovalyov, Mikhail Y.; Quilliot, Alain; Shabtay, Dvir; Zofi, Moshe: Bi-criteria path problem with minimum length and maximum survival probability (2019)
  18. Howe, Jacob M.; King, Andy; Simon, Axel: Incremental closure for systems of two variables per inequality (2019)
  19. Jukna, Stasys; Seiwert, Hannes: Greedy can beat pure dynamic programming (2019)
  20. Peng, Chao; Zeng, Haibo; Di Natale, Marco: A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs (2019)

1 2 3 ... 11 12 13 next