The minimum cost 2-edge-connected spanning subgraph problem: an evaluation of neighbourhoods for local search

Activity: Talks and presentations › Talks and presentations in private or public companies

Description

Emneord: graph theory, heuristics
Period8. Jun 2007
Event titleThe minimum cost 2-edge-connected spanning subgraph problem: an evaluation of neighbourhoods for local search
Event typeConference
OrganiserDepartment of Computer Science
LocationUniversity of Victoria, CanadaShow on map

Keywords

  • graph theory
  • heuristics