Modeling and Optimizing for NP-hard Problems in Graph Theory

This PhD thesis introduces optimization methods for graph problems classified as NP-hard. These are problems for which no deterministic algorithm is capable of solving them in polynomial time. More specifically, three graph problems were addressed, and for each, different optimization methods were u...

Full description

Saved in:
Bibliographic Details
Main Author: Anaqreh Ahmad
Other Authors: Gazdag-Tóth Boglárka
Vinkó Tamás
Format: Dissertation
Published: 2024-05-10
Online Access:

Similar Items