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...
Saved in:
| Main Author: | |
|---|---|
| Format: | doctoralThesis |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/20.500.12008/34293 |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: GRASP/VND Optimization Algorithms for Hard Combinatorial Problems
- Uniformly Optimally Reliable Graphs: A Survey
- Universal Reliability Bounds for Sparse Networks
- Analysis and optimization of highly reliable systems
- Static reliability and resilience in dynamic systems
- A Simple Proof of the Gross-Saccoman Multigraph Conjecture
- Topological Design of Survivable Networks