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

Fattahi, Ali; Turkay, Metin

JSON-LD (schema.org)

{
  "@context": "https://schema.org/", 
  "@id": 34165, 
  "@type": "ScholarlyArticle", 
  "creator": [
    {
      "@type": "Person", 
      "affiliation": "Univ Calif Los Angeles, Anderson Sch Management, 110 Westwood Plaza, Los Angeles, CA 90095 USA", 
      "name": "Fattahi, Ali"
    }, 
    {
      "@type": "Person", 
      "affiliation": "Koc Univ, Dept Ind Engn, TR-34450 Istanbul, Turkey", 
      "name": "Turkay, Metin"
    }
  ], 
  "datePublished": "2018-01-01", 
  "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.", 
  "headline": "A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems", 
  "identifier": 34165, 
  "image": "https://aperta.ulakbim.gov.tr/static/img/logo/aperta_logo_with_icon.svg", 
  "license": "http://www.opendefinition.org/licenses/cc-by", 
  "name": "A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems", 
  "url": "https://aperta.ulakbim.gov.tr/record/34165"
}