Search
Now showing items 1-3 of 3
Conflicting edges spanning trees and NP-Hard subgraph identification problems
(Universita degli studi di Salerno, 2018-04-17)
How often do we try to get the best result with the least effort, spend as little
time as possible to perform a task or make the most of the resources available in
the workplace? In everyday life, the word ”optimize” is ...
Polyhedral analysis and branch and cut algorithms for some NP-hard spanning subgraph problems
(Universita degli studi di Salerno, 2020-01-07)
There is a widespread need to use a quantitative approach for the solution of decision problems that arise in many different areas of real life. The goal is to choose which decisions to take to manage a real system as ...
Hidden Structures and Conflicting Items in Combinatorial Optimization Problems
(Universita degli studi di Salerno, 2023-02-14)
Combinatorial optimization-based methods are widely used to solve complex real life problems.
In this thesis, we use some of these methods for addressing several emerging combinatorial opti-
mization problems on graphs ...