Search
Now showing items 1-1 of 1
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 ...