A new effective mathematical programming model to design CDN topology

The Steiner Tree Problem is an umbrella of combinatorial optimization problems in graphs, most of them NP-Hard, within which, the Steiner Tree Problem in graphs (STP) is perhaps one of the most famous and widely studied. The STP consists in optimally interconnect a given set of terminal or mandatory...

Full description

Bibliographic Details

Main Author:	Bentos, Milton (author)
Format:	masterThesis
Language:	English
Published:	2019
Subjects:	Flow-based model Flexible model Effective optimization Linealization Mixed-integer problem formulation Ford-Fulkerson algorithm Steiner Tree Problem Quality of Service Multicast Tree Problem
Online Access:	https://hdl.handle.net/20.500.12008/26247
Tags:	Add Tag No Tags, Be the first to tag this record!