Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. Ventresca, M. Comput. Oper. Res., 39(11):2763-2775, 2012.
Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. [link]Link  Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. [link]Paper  bibtex   
@article{journals/cor/Ventresca12,
  added-at = {2020-02-18T00:00:00.000+0100},
  author = {Ventresca, Mario},
  biburl = {https://www.bibsonomy.org/bibtex/2826def1dedf05c8dfe59d05f89e65f6c/dblp},
  ee = {https://doi.org/10.1016/j.cor.2012.02.008},
  interhash = {b0acf16beabb158f9999a343448b7b89},
  intrahash = {826def1dedf05c8dfe59d05f89e65f6c},
  journal = {Comput. Oper. Res.},
  keywords = {dblp},
  number = 11,
  pages = {2763-2775},
  timestamp = {2020-02-19T11:46:32.000+0100},
  title = {Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem.},
  url = {http://dblp.uni-trier.de/db/journals/cor/cor39.html#Ventresca12},
  volume = 39,
  year = 2012
}

Downloads: 0