Endüstri Mühendisliği

Öncan, T., Akyüz, M.H., Altınel, İ.K., “A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs”, Open Proceedings of the International Network Optimization Conference, INOC 2019, University of Avignon, Avignon, France, 2019.

Türkçe

Ekim, T., Shalom, M., Şeker, O., “The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation”, International Symposium on Experimental Algorithms SEA 2019: Analysis of Experimental Algorithms, LNCS 11544, 21-34, Kalamata, Greece, 2019.

Türkçe

Beşikçi, U., Bilge, Ü., Ulusoy, G., “Resource Portfolio Problem Under Relaxed Resource Dedication Policy in Multi-mode Multi-project Scheduling”, International Journal of Mathematics in Operational Research, 14(4), 541-567, 2019.

Türkçe

Sayfalar