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. 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
{"_id":"X8dQGxisXq9ryNcWT","bibbaseid":"ventresca-globalsearchalgorithmsusingacombinatorialunrankingbasedproblemrepresentationforthecriticalnodedetectionproblem-2012","author_short":["Ventresca, M."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-02-18T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Ventresca"],"firstnames":["Mario"],"suffixes":[]}],"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","bibtex":"@article{journals/cor/Ventresca12,\n added-at = {2020-02-18T00:00:00.000+0100},\n author = {Ventresca, Mario},\n biburl = {https://www.bibsonomy.org/bibtex/2826def1dedf05c8dfe59d05f89e65f6c/dblp},\n ee = {https://doi.org/10.1016/j.cor.2012.02.008},\n interhash = {b0acf16beabb158f9999a343448b7b89},\n intrahash = {826def1dedf05c8dfe59d05f89e65f6c},\n journal = {Comput. Oper. Res.},\n keywords = {dblp},\n number = 11,\n pages = {2763-2775},\n timestamp = {2020-02-19T11:46:32.000+0100},\n title = {Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem.},\n url = {http://dblp.uni-trier.de/db/journals/cor/cor39.html#Ventresca12},\n volume = 39,\n year = 2012\n}\n\n","author_short":["Ventresca, M."],"key":"journals/cor/Ventresca12","id":"journals/cor/Ventresca12","bibbaseid":"ventresca-globalsearchalgorithmsusingacombinatorialunrankingbasedproblemrepresentationforthecriticalnodedetectionproblem-2012","role":"author","urls":{"Link":"https://doi.org/10.1016/j.cor.2012.02.008","Paper":"http://dblp.uni-trier.de/db/journals/cor/cor39.html#Ventresca12"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/mario%20ventresca?items=1000","dataSources":["RLFDMZMWW7Ps5vpgQ","Ck8iJJ5zmAj377iYj","aABj84ppQaei4P3aS"],"keywords":["dblp"],"search_terms":["global","search","algorithms","using","combinatorial","unranking","based","problem","representation","critical","node","detection","problem","ventresca"],"title":"Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem.","year":2012}