Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem

Leitner, Markus; Raidl, Günther R.

doi:10.1109/SAINT.2008.57

by Markus Leitner, Günther R. Raidl

Reference:

Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location ProblemMarkus Leitner, Günther R. RaidlProceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 233–236, 2008, IEEE Computer Society.

Bibtex Entry:

@INPROCEEDINGS{leitner-08a,
  author    = {Markus Leitner and G{\"u}nther R. Raidl}, 
  title     = {Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem},
  booktitle = {Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008},
  year      = {2008},
  pages     = {233--236},
  publisher = {IEEE Computer Society},
  doi        = {10.1109/SAINT.2008.57},
  isbn      = {978-0-7695-3297-4},
keywords = {netdesign,vns,netquest},
  url = {https://www.ac.tuwien.ac.at/files/pub/leitner-08a.pdf},
}