Exact and memetic algorithms for two network design problems / Ivana Ljubić
ger: This thesis focuses on two NP-hard network design problems:<br />the first one, vertex biconnectivity augmentation (V2AUG), appears in the design of survivable communication or electricity networks. In this problem we search for the set of connections of minimal total cost which, when add...
Saved in:
| VerfasserIn: | |
|---|---|
| Place / Publishing House: | 2004 |
| Year of Publication: | 2004 |
| Language: | English |
| Subjects: | |
| Classification: | 54.62 - Datenstrukturen 54.80 - Angewandte Informatik 54.72 - Künstliche Intelligenz 54.51 - Programmiermethodik |
| Online Access: | |
| Physical Description: | V, 177 S.; Ill., graph. Darst. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Copies
OeAW BAS:IS (Library, Archiv, Collections)
| Location: | BASIS-Monographies |
| Call Numbers: | 33255-C.Stip. |
| Call Number | 2nd Call Number | Description | Location | Remarks | Status | Availability | Order |
|---|---|---|---|---|---|---|---|
| 33255-C.Stip. | BASIS-Monographies | Loan | Available | Place a Hold |