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

Belotti, Pietro; Soylu, Banu; Wiecek, Margaret M.

JSON

{
  "conceptrecid": "58286", 
  "created": "2021-03-16T00:29:28.662924+00:00", 
  "doi": "10.1016/j.disopt.2016.09.003", 
  "files": [
    {
      "bucket": "a667b4d4-9078-485e-a2bd-4c2389de7514", 
      "checksum": "md5:c464c6c33c881a7fbe1cffd47025d093", 
      "key": "bib-7665584b-2309-4a5e-b896-8abde280ee9c.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/a667b4d4-9078-485e-a2bd-4c2389de7514/bib-7665584b-2309-4a5e-b896-8abde280ee9c.txt"
      }, 
      "size": 171, 
      "type": "txt"
    }
  ], 
  "id": 58287, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.1016/j.disopt.2016.09.003.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/a667b4d4-9078-485e-a2bd-4c2389de7514", 
    "doi": "https://doi.org/10.1016/j.disopt.2016.09.003", 
    "html": "https://aperta.ulakbim.gov.tr/record/58287", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/58287", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/58287"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "FICO, Xpress Optimizer Team, Birmingham B37 7GN, W Midlands, England", 
        "name": "Belotti, Pietro"
      }, 
      {
        "affiliation": "Erciyes Univ, Dept Ind Engn, TR-38039 Kayseri, Turkey", 
        "name": "Soylu, Banu"
      }, 
      {
        "affiliation": "Clemson Univ, Dept Math Sci, Clemson, SC 29630 USA", 
        "name": "Wiecek, Margaret M."
      }
    ], 
    "description": "We consider the class of biobjective mixed integer linear programs (BOMILPs). We review fathoming rules for general BOMILPs and present them in a unified manner. We then propose new fathoming rules that rely on solving specially designed LPs, hence making no assumption on the type of problem and only using polynomial-time algorithms. We describe an enhancement for carrying out these rules by performing a limited number of pivot operations on an LP, and then we provide insight that helps to make these rules even more efficient by either focusing on a smaller number of feasible solutions or by resorting to heuristics that limit the number of LPs solved. (C) 2016 Elsevier B.V. All rights reserved.", 
    "doi": "10.1016/j.disopt.2016.09.003", 
    "has_grant": false, 
    "journal": {
      "pages": "341-363", 
      "title": "DISCRETE OPTIMIZATION", 
      "volume": "22"
    }, 
    "license": {
      "id": "cc-by"
    }, 
    "publication_date": "2016-01-01", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "58287"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "58286"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "article", 
      "title": "Dergi makalesi", 
      "type": "publication"
    }, 
    "title": "Fathoming rules for biobjective mixed integer linear programs: Review and extensions"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 9.0, 
    "unique_downloads": 9.0, 
    "unique_views": 48.0, 
    "version_downloads": 9.0, 
    "version_unique_downloads": 9.0, 
    "version_unique_views": 48.0, 
    "version_views": 50.0, 
    "version_volume": 1539.0, 
    "views": 50.0, 
    "volume": 1539.0
  }, 
  "updated": "2021-03-16T00:29:28.707432+00:00"
}