References in zbMATH (referenced in 216 articles )

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

1 2 3 ... 9 10 11 next

  1. 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)
  2. Howe, Jacob M.; King, Andy; Simon, Axel: Incremental closure for systems of two variables per inequality (2019)
  3. Jukna, Stasys; Seiwert, Hannes: Greedy can beat pure dynamic programming (2019)
  4. Akgün, İbrahim; Tansel, Barbaros Ç.: (p)-hub median problem for non-complete networks (2018)
  5. Bérczi, Kristóf; Jüttner, Alpár; Laumanns, Marco; Szabó, Jácint: Arrival time dependent routing policies in public transport (2018)
  6. Buyanov, M. V.; Naumov, A. V.: Optimizing the operation of rolling stock in organizing cargo transportation at a railway network segment (2018)
  7. Cândido, Renato Markele Ferreira; Hardouin, Laurent; Lhommeau, Mehdi; Santos Mendes, Rafael: Conditional reachability of uncertain max plus linear systems (2018)
  8. De Santis, Roberta; Montanari, Roberto; Vignali, Giuseppe; Bottani, Eleonora: An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses (2018)
  9. Dvořák, Pavel; Knop, Dušan: Parameterized complexity of length-bounded cuts and multicuts (2018)
  10. Guttmann, Walter: An algebraic framework for minimum spanning tree problems (2018)
  11. Hu, Hao; Sotirov, Renata: Special cases of the quadratic shortest path problem (2018)
  12. Joudrier, Hugo; Thiard, Florence: A greedy approach for a rolling stock management problem using multi-interval constraint propagation. A greedy approach for a rolling stock management problem using multi-interval constraint propagation, ROADEF/EURO challenge 2014 (2018)
  13. Koltai, Péter; Renger, D. R. Michiel: From large deviations to semidistances of transport and mixing: coherence analysis for finite Lagrangian data (2018)
  14. Williams, R. Ryan: Faster all-pairs shortest paths via circuit complexity (2018)
  15. Zhu, Qunxi; Liu, Yang; Lu, Jianquan; Cao, Jinde: On the optimal control of Boolean control networks (2018)
  16. Al-Bataineh, Omar; Reynolds, Mark; French, Tim: Finding minimum and maximum termination time of timed automata models with cyclic behaviour (2017)
  17. Bertsimas, Dimitris; Griffith, J. Daniel; Gupta, Vishal; Kochenderfer, Mykel J.; Mišić, Velibor V.: A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems (2017)
  18. Bistarelli, Stefano; Santini, Francesco: On merging two trust-networks in one with bipolar preferences (2017)
  19. Brimkov, Boris; Hicks, Illya V.: Memory efficient algorithms for cactus graphs and block graphs (2017)
  20. Brodnik, Andrej; Grgurovič, Marko: Solving all-pairs shortest path by single-source computations: theory and practice (2017)

1 2 3 ... 9 10 11 next