Please use this identifier to cite or link to this item:
http://elea.unisa.it/xmlui/handle/10556/3020
Title: | Conflicting edges spanning trees and NP-Hard subgraph identification problems |
Authors: | Pentangelo, Rosa Scarpa, Roberto Cerulli, Raffaele Carrabs, Francesco |
Keywords: | NP-hard problems;Conflicting edges |
Issue Date: | 17-Apr-2018 |
Publisher: | Universita degli studi di Salerno |
Abstract: | 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 therefore often present. In particular, the optimization has as its object the study and the development of quantitative methodologies and tools for the solution of decision problems. This is a discipline born in the military field about 80 years ago. Over the years, it has found application in several sectors such as logistics and production, finance and telecommunications. Currently it has become an indispensable tool for supporting decision-making processes. The problems faced are typically those in which decisions have to be made on the use of resources available in limited quantities in order to respect an assigned set of constraints, maximizing, for example, the benefit obtainable from the use of the resources themselves... [edited by Author] |
Description: | 2016 - 2017 |
URI: | http://hdl.handle.net/10556/3020 http://dx.doi.org/10.14273/unisa-1310 |
Appears in Collections: | Matematica, Fisica ed Applicazioni |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
tesi_di_dottorato_R_Pentangelo.pdf | tesi di dottorato | 7,36 MB | Adobe PDF | View/Open |
abstract_in_inglese_e_italiano_R_Pentangelo.pdf | abstract in inglese e in italiano a cura dell'autore | 55,68 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.