Please use this identifier to cite or link to this item:
http://elea.unisa.it/xmlui/handle/10556/6466
Title: | Polyhedral analysis and branch and cut algorithms for some NP-hard spanning subgraph problems |
Authors: | Laureana, Federica Attanasio, Carmine Cerulli, Raffaele Carrabs, Francesco |
Keywords: | Analisi poliedrale;Branch vertices;Branch and cut |
Issue Date: | 7-Jan-2020 |
Publisher: | Universita degli studi di Salerno |
Abstract: | 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 efficiently as possible using mathematical tools. Operations Research provides a scientific basis to try to analyze and understand situations even with very complex structures and then use the gathered information to pre dict the behaviour of a system and improve the performance of the system itself. The analysis of a real problem occurs in two phases: the representation of the problem through a mathematical model and the development of efficient mathematical methods to determine an optimal solution of the problem or a good approximation of it. Therefore, the Operations Research is the science that deals with giving a unitary context to mathematical and computer science concepts and that starting from theoretical bases arrives at the construction of concrete models and their solution. .. [edited by the Author] |
Description: | 2018 - 2019 |
URI: | http://elea.unisa.it:8080/xmlui/handle/10556/6466 http://dx.doi.org/10.14273/unisa-4538 |
Appears in Collections: | Matematica, Fisica ed Applicazioni |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
tesi di dottorato F. Laureana.pdf | tesi di dottorato | 1,94 MB | Adobe PDF | View/Open |
abstract in italiano e in inglese F. Laureana.pdf | abstract in italiano e in inglese a cura dell'Autore | 42,98 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.