JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Uzhhorod National University", 
          "id": "https://www.grid.ac/institutes/grid.77512.36", 
          "name": [
            "Uzhhorod National University, Uzhhorod, Ukraine"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Chupov", 
        "givenName": "S. V.", 
        "id": "sg:person.013767235045.43", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013767235045.43"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1057/jors.1990.166", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1008396729", 
          "https://doi.org/10.1057/jors.1990.166"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.ejor.2004.01.024", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1014433273"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.ejor.2007.06.068", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1033943588"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s10559-016-9855-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1034255202", 
          "https://doi.org/10.1007/s10559-016-9855-9"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s10559-016-9855-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1034255202", 
          "https://doi.org/10.1007/s10559-016-9855-9"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-1-4613-1361-8_25", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1034396442", 
          "https://doi.org/10.1007/978-1-4613-1361-8_25"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0377-2217(03)00274-1", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1035335840"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0377-2217(03)00274-1", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1035335840"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.4236/apm.2016.610055", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1052452785"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1023/a:1009642405419", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1053131829", 
          "https://doi.org/10.1023/a:1009642405419"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2018-07", 
    "datePublishedReg": "2018-07-01", 
    "description": "A new scheme of approximate lexicographic search is proposed for the solution of the multidimensional Boolean knapsack problem. The main idea of the algorithm is to gradually define the lexicographic order (ordering of variables) in which \u201cqualitative\u201d solutions of the problem belong to a direct two-sided lexicographic constraint whose upper bound is the lexicographic maximum of the set of feasible solutions of the problem in this order. Since the search for \u201cqualitative\u201d solutions in each order is carried out on a bounded lexicographic interval, the proposed algorithm is called a bounded lexicographic search. The quality of the approximate method of bounded lexicographic search is investigated by solving test tasks from the well-known Beasley and Glover\u2013Kochenberger sets.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s10559-018-0057-5", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1130475", 
        "issn": [
          "1060-0396", 
          "1573-8337"
        ], 
        "name": "Cybernetics and Systems Analysis", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "4", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "54"
      }
    ], 
    "name": "An Approximate Algorithm for Lexicographic Search in Multiple Orders for the Solution of the Multidimensional Boolean Knapsack Problem", 
    "pagination": "563-575", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "e37288733cc9bb018edc1ecd2ce282427d274c3b96ad788b0cbe231b4d2b75d3"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s10559-018-0057-5"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1105856410"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s10559-018-0057-5", 
      "https://app.dimensions.ai/details/publication/pub.1105856410"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T10:16", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000348_0000000348/records_54302_00000001.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://link.springer.com/10.1007%2Fs10559-018-0057-5"
  }
]

Download the RDF metadata as:  json-ld nt turtle xml License info

This table displays all metadata directly associated to this object as RDF triples.

89 TRIPLES      21 PREDICATES      35 URIs      19 LITERALS      7 BLANK NODES