The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search

Hu, Bin; Leitner, Markus; Raidl, Günther R.

by Bin Hu, Markus Leitner, Günther R. Raidl

Reference:

The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood SearchBin Hu, Markus Leitner, Günther R. Raidl2007, Technical report TR 186–1–07–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.

Bibtex Entry:

@TECHREPORT{hu-07,
  author = {Bin Hu and Markus Leitner and G\"unther R. Raidl},
  title = {The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search},
  institution = {Institute of Computer Graphics and Algorithms, Vienna University of Technology},
address = {Vienna, Austria},
  year = {2007},
  number = {TR 186--1--07--02},
  url = {https://www.ac.tuwien.ac.at/files/pub/hu-07.pdf},
keywords = {netdesign,vns,mip}
}