@inproceedings{MTMT:36377801,
	title = {An Iterative Preprocessing Method and Constraint Programming Formulation for the Train Dispatching Problem},
	url = {https://m2.mtmt.hu/api/publication/36377801},
	author = {Trautsch, László Kálmán},
	booktitle = {Proceedings of the Automation and Applied Computer Science Workshop 2025},
	unique-id = {36377801},
	year = {2025},
	pages = {56-67},
	orcid-numbers = {Trautsch, László Kálmán/0000-0002-1589-3265}
}

@inproceedings{MTMT:35148380,
	title = {Constraint Programming Formulation for a Complex Real-World Final Exam Scheduling Problem},
	url = {https://m2.mtmt.hu/api/publication/35148380},
	author = {Trautsch, László Kálmán},
	booktitle = {Proceedings of the Automation and Applied Computer Science Workshop 2024 : AACS'24},
	unique-id = {35148380},
	year = {2024},
	pages = {159-168},
	orcid-numbers = {Trautsch, László Kálmán/0000-0002-1589-3265}
}

@CONFERENCE{MTMT:35159506,
	title = {Constraint Programming formulation for a real-world final exam scheduling problem with parallel sessions based on short time intervals},
	url = {https://m2.mtmt.hu/api/publication/35159506},
	author = {Trautsch, László Kálmán and Kővári, Bence András},
	booktitle = {VOCAL 2024 : 10th VOCAL Optimization Conference : Advanced Algorithms : Budapest, Hungary, June 5-7, 2024},
	unique-id = {35159506},
	year = {2024},
	pages = {16-21},
	orcid-numbers = {Trautsch, László Kálmán/0000-0002-1589-3265; Kővári, Bence András/0000-0003-1555-640X}
}

@inproceedings{MTMT:35609353,
	title = {A Simulated Annealing Approach to the Multi-Activity Multi-Day Shift Scheduling Problem},
	url = {https://m2.mtmt.hu/api/publication/35609353},
	author = {Trautsch, László Kálmán and Kővári, Bence András},
	booktitle = {Proceedings of the 14th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2024},
	unique-id = {35609353},
	abstract = {This paper addresses the multi-activity multi-day shift scheduling problem with a homogeneous workforce and quadratic cost function for overstaffing. The objective of this problem is to assign shifts to employees and activities within these shifts based on short time intervals, respecting numerous hard constraints and minimizing overstaffing. We propose a multi-neighborhood Simulated Annealing algorithm as a solution method, for which we introduce eight neighborhood relations. The search space and neighborhood relations are designed so that the search algorithm can be executed efficiently even on large problem instances. The method is evaluated on a benchmark dataset consisting of problem instances with varying complexity. The results show that our approach can handle even the most complex tasks and is able to find feasible solutions for 201 out of the 225 total problem instances, of which 99 were previously unsolved. Our method outperforms the solver that produced the previous best known solutions for the benchmark dataset and finds new best solutions for 190 of the instances. The algorithm can create good schedules in a matter of a few seconds, using limited computing resources. © 2024 PATAT. All Rights Reserved.},
	year = {2024},
	pages = {125-138},
	orcid-numbers = {Trautsch, László Kálmán/0000-0002-1589-3265; Kővári, Bence András/0000-0003-1555-640X}
}

@inproceedings{MTMT:34192705,
	title = {A General Format for Graph-Based Modelling of Scheduling Problems},
	url = {https://m2.mtmt.hu/api/publication/34192705},
	author = {Trautsch, László Kálmán and Erdős, Szilvia},
	booktitle = {Proceedings of the Automation and Applied Computer Science Workshop 2023 (AACS'23)},
	unique-id = {34192705},
	year = {2023},
	pages = {92-102},
	orcid-numbers = {Trautsch, László Kálmán/0000-0002-1589-3265}
}

@CONFERENCE{MTMT:34200213,
	title = {Egy általános gráf-alapú megközelítés munkavállalói ütemezési problémák modellezésére és előfeldolgozására},
	url = {https://m2.mtmt.hu/api/publication/34200213},
	author = {Trautsch, László Kálmán and Erdős, Szilvia},
	booktitle = {XXXV. Magyar Operációkutatás Konferencia},
	unique-id = {34200213},
	year = {2023},
	pages = {76-76},
	orcid-numbers = {Trautsch, László Kálmán/0000-0002-1589-3265}
}

@inproceedings{MTMT:34457490,
	title = {IDENTIFYING DRUG INTERACTIONS WITH A VARIATIONAL GRAPH AUTO-ENCODER USING MISSING DATA IMPUTATION},
	url = {https://m2.mtmt.hu/api/publication/34457490},
	author = {Trautsch, László Kálmán and Morvay, Balázs Tibor and Csikós, Marcell},
	booktitle = {XXVI. Tavaszi Szél Konferencia 2023},
	unique-id = {34457490},
	year = {2023},
	pages = {374-379},
	orcid-numbers = {Trautsch, László Kálmán/0000-0002-1589-3265; Morvay, Balázs Tibor/0009-0008-0555-587X}
}

@CONFERENCE{MTMT:34457300,
	title = {Solving a Final Exam Scheduling Problem with Constraint Programming},
	url = {https://m2.mtmt.hu/api/publication/34457300},
	author = {Trautsch, László Kálmán and Kővári, Bence András},
	booktitle = {Abstract book for the 19th MIKLÓS IVÁNYI INTERNATIONAL PHD & DLA SYMPOSIUM},
	unique-id = {34457300},
	year = {2023},
	orcid-numbers = {Trautsch, László Kálmán/0000-0002-1589-3265; Kővári, Bence András/0000-0003-1555-640X}
}

@inproceedings{MTMT:33117870,
	title = {State Space Modelling of a Final Exam Scheduling Problem},
	url = {https://m2.mtmt.hu/api/publication/33117870},
	author = {Trautsch, László Kálmán and Erdős, Szilvia},
	booktitle = {Proceedings of the Automation and Applied Computer Science Workshop 2022 (AACS'22)},
	unique-id = {33117870},
	year = {2022},
	pages = {115-126},
	orcid-numbers = {Trautsch, László Kálmán/0000-0002-1589-3265}
}

@article{MTMT:33757570,
	title = {Modelling different aspects of final exam scheduling problems for a graph-based state space reduction method},
	url = {https://m2.mtmt.hu/api/publication/33757570},
	author = {Trautsch, László Kálmán and Erdős, Szilvia},
	doi = {10.35925/j.multi.2022.3.5},
	journal-iso = {MULTIDISZCIPLINÁRIS TUDOMÁNYOK},
	journal = {MULTIDISZCIPLINÁRIS TUDOMÁNYOK: A MISKOLCI EGYETEM KÖZLEMÉNYE},
	volume = {12},
	unique-id = {33757570},
	issn = {2062-9737},
	abstract = {Final exam scheduling is a subtopic of scheduling where various special requirements with different levels of strictness should be managed. The formalisation of these requirements can be a challenge in itself. The number of possible schedules that should be examined is usually large, so the state space is vast. However, many of these schedules can be excluded completely at an early stage based on their inconsistency with the hard requirements, thus reducing the state space. The modelling approach for different aspects of final exam scheduling problems is presented in this paper through the modelling of an actual, complex problem. The created model was used as the basis for a state space reduction method. The results show that the method could handle all the hard and soft constraints of the problem and reduce the state space significantly based on them. The modelling approach can be used for formalising the requirements of various final exam scheduling and similar problems.},
	year = {2022},
	eissn = {2786-1465},
	pages = {45-55},
	orcid-numbers = {Trautsch, László Kálmán/0000-0002-1589-3265; Erdős, Szilvia/0000-0003-2171-1779}
}