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

Fattahi, Ali; Turkay, Metin

JSON

{
  "conceptrecid": "34164", 
  "created": "2021-03-15T19:05:19.157461+00:00", 
  "doi": "10.1016/j.ejor.2017.09.026", 
  "files": [
    {
      "bucket": "3d2bea71-dd41-427c-88bc-115ca9edb338", 
      "checksum": "md5:67ab34eb96f43343138cca44bd9c185e", 
      "key": "bib-e7066ca6-7422-4e62-9922-aeb4cefa2021.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/3d2bea71-dd41-427c-88bc-115ca9edb338/bib-e7066ca6-7422-4e62-9922-aeb4cefa2021.txt"
      }, 
      "size": 218, 
      "type": "txt"
    }
  ], 
  "id": 34165, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.1016/j.ejor.2017.09.026.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/3d2bea71-dd41-427c-88bc-115ca9edb338", 
    "doi": "https://doi.org/10.1016/j.ejor.2017.09.026", 
    "html": "https://aperta.ulakbim.gov.tr/record/34165", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/34165", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/34165"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "Univ Calif Los Angeles, Anderson Sch Management, 110 Westwood Plaza, Los Angeles, CA 90095 USA", 
        "name": "Fattahi, Ali"
      }, 
      {
        "affiliation": "Koc Univ, Dept Ind Engn, TR-34450 Istanbul, Turkey", 
        "name": "Turkay, Metin"
      }
    ], 
    "description": "The nondominated frontier (NDF) of a biobjective optimization problem is defined as the set of feasible points in the objective function space that cannot be improved in one objective function value without worsening the other. For a biobjective mixed-binary linear programming problem (BOMBLP), the NDF consists of some combination of isolated points and open, closed, or half-open/half-closed line segments. Some algorithms have been proposed in the literature to find an approximate or exact representation of the NDF. We present a one direction search (ODS) method to find the exact NDF of BOMBLPs. We provide a theoretical analysis of the ODS method and show that it generates the exact NDF. We also conduct a comprehensive experimental study on a set of benchmark problems and show the solution quality and computational efficacy of our algorithm. (C) 2017 Elsevier B.V. All rights reserved.", 
    "doi": "10.1016/j.ejor.2017.09.026", 
    "has_grant": false, 
    "journal": {
      "issue": "2", 
      "pages": "415-425", 
      "title": "EUROPEAN JOURNAL OF OPERATIONAL RESEARCH", 
      "volume": "266"
    }, 
    "license": {
      "id": "cc-by"
    }, 
    "publication_date": "2018-01-01", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "34165"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "34164"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "article", 
      "title": "Dergi makalesi", 
      "type": "publication"
    }, 
    "title": "A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 7.0, 
    "unique_downloads": 7.0, 
    "unique_views": 46.0, 
    "version_downloads": 7.0, 
    "version_unique_downloads": 7.0, 
    "version_unique_views": 45.0, 
    "version_views": 46.0, 
    "version_volume": 1526.0, 
    "views": 47.0, 
    "volume": 1526.0
  }, 
  "updated": "2021-03-15T19:05:19.211486+00:00"
}