• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
https://doi.org/10.11606/D.45.1997.tde-20210729-015111
Document
Author
Full name
Marcelo Gomes de Queiróz
E-mail
Institute/School/College
Knowledge Area
Date of Defense
Published
São Paulo, 1997
Supervisor
Title in Portuguese
Otimização global e o problema de designação de fluxos e capacidades
Keywords in Portuguese
Programação Não Linear
Abstract in Portuguese
Neste trabalho, é estudado o Problema de Designação de fluxos e Capacidades em redes de computadores, sob a perspectiva de programação Côncava. É obtida uma condição necessária para a caracterização de vértices do poliedro de fluxosmulticomodidade, bem como um algorítmo para o cômputo das arestas a partir de um vértice. A partir destas ferramentas, são propostas duas heurísticas para a busca do mínimoglobal do problema, cujas implementações e testes computacionais sãoincluídos, e comparados à aplicação do algorítmo de Tui-Zwart a este problema
Title in English
not available
Abstract in English
This work deals with the Capacity and Flow Assignment Problem for computer networks, viewed as a Concave Programming problem. A necessary condition for the characterization of extremal points of the multicommodity flow polyhedron is attained, aswell as an algorithm for the computation of the edges leaving a given extremal point. With these tools, two heuristics for the search of a global minimum for the problem are proposed. Their implementation and computational tests are alsoincluded, and compared to the ap[plication of the Tui-Zwart algorithm to this problem
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
Publishing Date
2021-07-29
 
WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
CeTI-SC/STI
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2022. All rights reserved.