GRASP/VND Optimization Algorithms for Hard Combinatorial Problems

Two hard combinatorial problems are addressed in this thesis. The first one is known as the ”Max CutClique”, a combinatorial problem introduced by P. Martins in 2012. Given a simple graph, the goal is to find a clique C such that the number of links shared between C and its complement C C is maximum...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Stabile Suárez, Luis Alberto (author)
Format:	doctoralThesis
Sprache:	Englisch
Veröffentlicht:	2019
Schlagworte:	Max Cut-Clique Uniformly Most-Reliable Graph Stochastic Binary System GRASP VND
Online-Zugang:	https://hdl.handle.net/20.500.12008/34293
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!