JavaScript is disabled for your browser. Some features of this site may not work without it.
Problemi hab maksimalnog pokrivanja– novi matematički modeli i metode rešavanja
Doktorand:Stančić (rodj. Janković), Olivera
Fakultet: Matematički fakultet
Napomena: Rok za dostavljanje primedbi na doktorsku disertaciju je istekao.
Datum postavljanja na uvid javnosti: 16-10-2018
Datum odbrane: 07-12-2018
Objavljeni radovi:
[1] [1] Janković, O., Mišković, S., Stanimirović, Z., Todosijević, R., "Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems", Annals of Operations Research, 2017, Vol. 29, No.1-2, pp. 191-2016, DOI: 10.1007/s10479-017-2508-1. (М22, IF 2017 1.864) [2] Janković, O., “An efficient genetic algorithm for the uncapacitated r-allocation p-hub maximal covering problem”, Yugoslav Journal of Operations Research, 2018, Vol. 28, No. 2, pp. 201-218, 2018. (M51) [3] Janković, O., Stanimirović, Z., "A general variable neighborhood search for solving the uncapacitated r-allocation p-hub maximal covering problem", Electronic Notes in Discrete Mathematics, Vol. 58C, 2017, pp. 23-30, DOI: 10.1016/j.endm.2017.03.004. [4] Janković, O., "Solving the uncapacitated r-allocation p-hub maximal covering problem using genetic algorithm", Proceedings of the XLIII Symposium on Operational Research-SYMOPIS 2016, Tara, September 20-23. 2016, ISBN 978-86-335-0535-2, pp. 287-291. (M33).