1 Ocak 2012 Dergi makalesi Açık Erişim

Fouilhoux, Pierre; Karasan, Oya Ekin; Mahjoub, A. Ridha; Ozkok, Onur; Yaman, Hande

JSON

{
  "conceptrecid": "86436", 
  "created": "2021-03-16T06:55:31.949537+00:00", 
  "doi": "10.1002/net.20479", 
  "files": [
    {
      "bucket": "a26885cd-4ead-41fb-8ced-f7281db5eac9", 
      "checksum": "md5:b7f10847fdc70d3469f3b8a70887e563", 
      "key": "bib-c3c591d7-efb9-4370-b4b0-611e9a3004b4.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/a26885cd-4ead-41fb-8ced-f7281db5eac9/bib-c3c591d7-efb9-4370-b4b0-611e9a3004b4.txt"
      }, 
      "size": 153, 
      "type": "txt"
    }
  ], 
  "id": 86437, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.1002/net.20479.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/a26885cd-4ead-41fb-8ced-f7281db5eac9", 
    "doi": "https://doi.org/10.1002/net.20479", 
    "html": "https://aperta.ulakbim.gov.tr/record/86437", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/86437", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/86437"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "Univ Paris 06, Lab LIP6, F-75005 Paris, France", 
        "name": "Fouilhoux, Pierre"
      }, 
      {
        "affiliation": "Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey", 
        "name": "Karasan, Oya Ekin"
      }, 
      {
        "affiliation": "Univ Paris 09, LAMSADE, F-75775 Paris 16, France", 
        "name": "Mahjoub, A. Ridha"
      }, 
      {
        "affiliation": "Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey", 
        "name": "Ozkok, Onur"
      }, 
      {
        "affiliation": "Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey", 
        "name": "Yaman, Hande"
      }
    ], 
    "description": "The survivable hierarchical telecommunications network design problem consists of locating concentrators, assigning user nodes to concentrators, and linking concentrators in a reliable backbone network. In this article, we study this problem when the backbone is 2-edge connected and when user nodes are linked to concentrators by a point-to-point access network. We formulate this problem as an integer linear program and present a facial study of the associated polytope. We describe valid inequalities and give sufficient conditions for these inequalities to be facet defining. We investigate the computational complexity of the corresponding separation problems. We propose some reduction operations to speed up the separation procedures. Finally, we devise a branch-and-cut algorithm based on these results and present the outcome of a computational study. (C) 2011 Wiley Periodicals, Inc. NETWORKS, Vol. 59(1), 37-58 2012", 
    "doi": "10.1002/net.20479", 
    "has_grant": false, 
    "journal": {
      "issue": "1", 
      "pages": "37-58", 
      "title": "NETWORKS", 
      "volume": "59"
    }, 
    "license": {
      "id": "cc-by"
    }, 
    "publication_date": "2012-01-01", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "86437"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "86436"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "article", 
      "title": "Dergi makalesi", 
      "type": "publication"
    }, 
    "title": "Survivability in hierarchical telecommunications networks"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 11.0, 
    "unique_downloads": 11.0, 
    "unique_views": 70.0, 
    "version_downloads": 11.0, 
    "version_unique_downloads": 11.0, 
    "version_unique_views": 69.0, 
    "version_views": 71.0, 
    "version_volume": 1683.0, 
    "views": 72.0, 
    "volume": 1683.0
  }, 
  "updated": "2021-03-16T06:55:32.002464+00:00"
}