Andrija Urošević
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Andrija Urošević has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Dragutin Ostojić
Faculty of Science, Department of Mathematics and Informatics, University of Kragujevac, 34000 Kragujevac, Serbia
1 shared publication - Dušan Ramljak
School of Professional Graduate Studies at Great Valley, The Pennsylvania State University, Malvern, PA 19355, USA
1 shared publication - Filip Marić
Faculty of Mathematics, University of Belgrade, Belgrade, Serbia
1 shared publication - Jainil Kakka
Engineering Department, Penn State Great Valley, The Pennsylvania State University, University Park, PA 16802, USA
1 shared publication - Marija Jolović
Faculty of Science, Department of Mathematics and Informatics, University of Kragujevac, 34000 Kragujevac, Serbia
1 shared publication - Radovan Drašković
Faculty of Science, Department of Mathematics and Informatics, University of Kragujevac, 34000 Kragujevac, Serbia
1 shared publication
Latest Publications
- Open Access
Systematic Literature Review of Optimization Algorithms for P||Cmax Problem
In the era of open data and open science, it is important that, before announcing their new results, authors consider all previous studies and ensure that they have competitive material worth publishing. To save time, it is popular to replace the exhaustive search of online databases with the utilization of generative Artificial Intelligence (AI). However, especially for problems in niche domains, generative AI results may not be precise enough and sometimes can even be misleading. A typical example is , an important scheduling problem studied mainly in a wider context of parallel machine scheduling. As there is an uncovered symmetry between and other similar optimization problems, it is not easy for generative AI tools to include all relevant results into search. Therefore, to provide the necessary background data to support researchers and generative AI learning, we critically discuss comparisons between algorithms for that have been presented in the literature. Thus, we summarize and categorize the “state-of-the-art” methods, benchmark test instances, and compare methodologies, all over a long time period. We aim to establish a framework for fair performance evaluation of algorithms for , and according to the presented systematic literature review, we uncovered that it does not exist. We believe that this framework could be of wider importance, as the identified principles apply to a plethora of combinatorial optimization problems.Open AccessSystematic Literature Review of Optimization Algorithms for P||Cmax Problem
In the era of open data and open science, it is important that, before announcing their new results, authors consider all previous studies and ensure that they have competitive material worth publishing. To save time, it is popular to replace the exhaustive search of online databases with the utilization of generative Artificial Intelligence (AI). However, especially for problems in niche domains, generative AI results may not be precise enough and sometimes can even be misleading. A typical example is , an important scheduling problem studied mainly in a wider context of parallel machine scheduling. As there is an uncovered symmetry between and other similar optimization problems, it is not easy for generative AI tools to include all relevant results into search. Therefore, to provide the necessary background data to support researchers and generative AI learning, we critically discuss comparisons between algorithms for that have been presented in the literature. Thus, we summarize and categorize the “state-of-the-art” methods, benchmark test instances, and compare methodologies, all over a long time period. We aim to establish a framework for fair performance evaluation of algorithms for , and according to the presented systematic literature review, we uncovered that it does not exist. We believe that this framework could be of wider importance, as the identified principles apply to a plethora of combinatorial optimization problems. - Open Access
- 1 January 2024
- Published by Centre for Evaluation in Education and Science (CEON/CEES) in Journal of Educational Studies in Mathematics and Computer Science
- Vol. 1 (2) , 37-49
Improving mathematical proving skills through interactive theorem proving
Understanding and constructing proofs of mathematical theorems is a fundamental component of mastering mathematics and developing the logical apparatus. In addition, the theorems in mathematical textbooks are often only understandable through their proofs. However, students sometimes lack the precision needed to write detailed proofs and the understanding of basic proving concepts. In this paper, we propose the use of interactive theorem provers by math teachers with the goal of improving students' mathematical proving skills and understanding of logical rules. This approach utilizes feedback from interactive theorem provers while gradually progressing through carefully selected areas of mathematics and computer science. We propose the focused use of two areas, firstly the subset of elementary mathematical theorems and secondly an area that can be selected by teachers in relation to their subject area (and can include almost any area of mathematics and computer science). The proposed approach was implemented in the elective course "Introduction to Interactive Theorem Proving" for fourth year undergraduate students at the Faculty of Mathematics in Belgrade. The course utilizes the interactive theorem prover Isabelle and encompasses constructing formal proofs of elementary mathematical theorems (selected as the first area) and the formal verification of appropriate functional algorithms (selected as the second area). Upon completion of the course, students attain proficiency to formalize tasks and solutions from international mathematical Olympiads and to verify certain algorithms and data structures. The results of our approach are based on the experience with six generations of students who have carried out a variety of formalization projects from different areas of mathematics and computer science, thus demonstrating the vast applicability of the proposed approach. We show that under intensive teacher guidance, students are quite capable of understanding and constructing formal proofs. This resulted in an extremely positive outcome in the first use of interactive theorem proving at the undergraduate level. The course is designed in such a way that the required prior knowledge is ground-level mathematical knowledge. Thus, it is possible to learn interactive theorem proving in parallel with the mathematical logic courses, with the aim of additionally understanding important logic and proof concepts used in all areas of mathematics from the very beginning.
- 1 January 2024
- Published by Centre for Evaluation in Education and Science (CEON/CEES) in Journal of Educational Studies in Mathematics and Computer Science
- Vol. 1 (2) , 37-49
Open AccessImproving mathematical proving skills through interactive theorem proving
Understanding and constructing proofs of mathematical theorems is a fundamental component of mastering mathematics and developing the logical apparatus. In addition, the theorems in mathematical textbooks are often only understandable through their proofs. However, students sometimes lack the precision needed to write detailed proofs and the understanding of basic proving concepts. In this paper, we propose the use of interactive theorem provers by math teachers with the goal of improving students' mathematical proving skills and understanding of logical rules. This approach utilizes feedback from interactive theorem provers while gradually progressing through carefully selected areas of mathematics and computer science. We propose the focused use of two areas, firstly the subset of elementary mathematical theorems and secondly an area that can be selected by teachers in relation to their subject area (and can include almost any area of mathematics and computer science). The proposed approach was implemented in the elective course "Introduction to Interactive Theorem Proving" for fourth year undergraduate students at the Faculty of Mathematics in Belgrade. The course utilizes the interactive theorem prover Isabelle and encompasses constructing formal proofs of elementary mathematical theorems (selected as the first area) and the formal verification of appropriate functional algorithms (selected as the second area). Upon completion of the course, students attain proficiency to formalize tasks and solutions from international mathematical Olympiads and to verify certain algorithms and data structures. The results of our approach are based on the experience with six generations of students who have carried out a variety of formalization projects from different areas of mathematics and computer science, thus demonstrating the vast applicability of the proposed approach. We show that under intensive teacher guidance, students are quite capable of understanding and constructing formal proofs. This resulted in an extremely positive outcome in the first use of interactive theorem proving at the undergraduate level. The course is designed in such a way that the required prior knowledge is ground-level mathematical knowledge. Thus, it is possible to learn interactive theorem proving in parallel with the mathematical logic courses, with the aim of additionally understanding important logic and proof concepts used in all areas of mathematics from the very beginning.