• Algorithms and Models For Combinatorial Optimization Problems
  • Fernandes Muritiba, Albert Einstein <1983>

Subject

  • MAT/09 Ricerca operativa

Description

  • In this thesis we present some combinatorial optimization problems, suggest models and algorithms for their effective solution. For each problem,we give its description, followed by a short literature review, provide methods to solve it and, finally, present computational results and comparisons with previous works to show the effectiveness of the proposed approaches. The considered problems are: the Generalized Traveling Salesman Problem (GTSP), the Bin Packing Problem with Conflicts(BPPC) and the Fair Layout Problem (FLOP).

Date

  • 2010-03-30

Type

  • Doctoral Thesis
  • PeerReviewed

Format

  • application/pdf

Identifier

http://amsdottorato.unibo.it/2897/1/FernandesMuritiba_AlbertEinstein_tesi.pdf

urn:nbn:it:unibo-2155

Fernandes Muritiba, Albert Einstein (2010) Algorithms and Models For Combinatorial Optimization Problems , [Dissertation thesis], Alma Mater Studiorum Università di Bologna. Dottorato di ricerca in Automatica e ricerca operativa , 22 Ciclo. DOI 10.6092/unibo/amsdottorato/2897.

Relations

http://amsdottorato.unibo.it/2897/