{"entity":{"id":"4ca3e70f-3712-4c55-bff3-7cc195adfde8","slug":"a-co-evolutionary-hybrid-decomposition-based-algorithm-for-bi-level-combinatorial-optimization-problems","wikidata_id":"openalex:W2974463220","name":"A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems","wikidata_url":"https://www.wikidata.org/wiki/openalex:W2974463220"},"generated_at":"2026-11-04T01:00:17+00:00","notes":"as_of = the source edition date we serve. stale = edition age > the source's max_staleness SLA in the lake catalog; null = no SLA declared (never guessed). Wikidata-sourced statements are not listed: their lineage is the Wikidata item and its revision history.","facts":[{"kind":"lane_claim","pid":"P356","label":"DOI","value":"10.1007/S00500-019-04337-0","freshness":{"as_of":"2026-09-23","as_of_basis":"source_edition","edition":"20260923","age_days":42,"max_staleness_days":null,"expected_cadence":null,"sla_declared":false,"stale":null,"latest_edition":null,"newer_edition_landed":false},"lineage":{"source":"openalex","catalog_key":null,"source_name":"OpenAlex","publisher_url":"https://openalex.org","record_url":null,"edition":"20260923","retrieved":null,"licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"bronze":{"manifest_sha256":null,"files":[],"file_count":0},"transform":{"agent":"4ort-mint","lane":"openalex:20260923","version":null,"version_recorded":false}}},{"kind":"lane_claim","pid":"P577","label":"Publication date","value":"+2019-09-21T00:00:00Z","freshness":{"as_of":"2026-09-23","as_of_basis":"source_edition","edition":"20260923","age_days":42,"max_staleness_days":null,"expected_cadence":null,"sla_declared":false,"stale":null,"latest_edition":null,"newer_edition_landed":false},"lineage":{"source":"openalex","catalog_key":null,"source_name":"OpenAlex","publisher_url":"https://openalex.org","record_url":null,"edition":"20260923","retrieved":null,"licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"bronze":{"manifest_sha256":null,"files":[],"file_count":0},"transform":{"agent":"4ort-mint","lane":"openalex:20260923","version":null,"version_recorded":false}}},{"kind":"lane_claim","pid":"P1433","label":"Published in","value":"Q15764822","freshness":{"as_of":"2026-09-23","as_of_basis":"source_edition","edition":"20260923","age_days":42,"max_staleness_days":null,"expected_cadence":null,"sla_declared":false,"stale":null,"latest_edition":null,"newer_edition_landed":false},"lineage":{"source":"openalex","catalog_key":null,"source_name":"OpenAlex","publisher_url":"https://openalex.org","record_url":null,"edition":"20260923","retrieved":null,"licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"bronze":{"manifest_sha256":null,"files":[],"file_count":0},"transform":{"agent":"4ort-mint","lane":"openalex:20260923","version":null,"version_recorded":false}}},{"kind":"lane_claim","pid":"P1476","label":"Title","value":{"lang":"en","text":"A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems"},"freshness":{"as_of":"2026-09-23","as_of_basis":"source_edition","edition":"20260923","age_days":42,"max_staleness_days":null,"expected_cadence":null,"sla_declared":false,"stale":null,"latest_edition":null,"newer_edition_landed":false},"lineage":{"source":"openalex","catalog_key":null,"source_name":"OpenAlex","publisher_url":"https://openalex.org","record_url":null,"edition":"20260923","retrieved":null,"licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"bronze":{"manifest_sha256":null,"files":[],"file_count":0},"transform":{"agent":"4ort-mint","lane":"openalex:20260923","version":null,"version_recorded":false}}},{"kind":"lane_claim","pid":"P10283","label":"OpenAlex ID","value":"W2974463220","freshness":{"as_of":"2026-09-23","as_of_basis":"source_edition","edition":"20260923","age_days":42,"max_staleness_days":null,"expected_cadence":null,"sla_declared":false,"stale":null,"latest_edition":null,"newer_edition_landed":false},"lineage":{"source":"openalex","catalog_key":null,"source_name":"OpenAlex","publisher_url":"https://openalex.org","record_url":null,"edition":"20260923","retrieved":null,"licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"bronze":{"manifest_sha256":null,"files":[],"file_count":0},"transform":{"agent":"4ort-mint","lane":"openalex:20260923","version":null,"version_recorded":false}}}],"conflicts":[],"prov":{"prefix":{"xyz":"https://4ort.xyz/ns/prov#","lake":"https://4ort.xyz/ns/lake#","pub":"https://4ort.xyz/ns/publisher#","mint":"https://4ort.xyz/ns/mint#","prov":"http://www.w3.org/ns/prov#"},"entity":{"xyz:fact_01f5f29b3b7b":{"prov:type":"xyz:Statement","prov:label":"openalex:W2974463220 P356","xyz:property":"P356","prov:value":"10.1007/S00500-019-04337-0","xyz:as_of":"2026-09-23","xyz:stale":null},"lake:openalex_20260923":{"prov:type":"lake:Edition","prov:label":"OpenAlex edition 20260923","lake:edition":"20260923","lake:manifest_sha256":null,"lake:bronze_files":[],"lake:bronze_file_count":0,"xyz:licence":"CC0 1.0 Universal","xyz:licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","xyz:attribution":null,"prov:generatedAtTime":null},"xyz:fact_968caf916533":{"prov:type":"xyz:Statement","prov:label":"openalex:W2974463220 P577","xyz:property":"P577","prov:value":"+2019-09-21T00:00:00Z","xyz:as_of":"2026-09-23","xyz:stale":null},"xyz:fact_618a3c7d11df":{"prov:type":"xyz:Statement","prov:label":"openalex:W2974463220 P1433","xyz:property":"P1433","prov:value":"Q15764822","xyz:as_of":"2026-09-23","xyz:stale":null},"xyz:fact_cef6b80fddcb":{"prov:type":"xyz:Statement","prov:label":"openalex:W2974463220 P1476","xyz:property":"P1476","prov:value":"{'lang': 'en', 'text': 'A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems'}","xyz:as_of":"2026-09-23","xyz:stale":null},"xyz:fact_79d2b6b19368":{"prov:type":"xyz:Statement","prov:label":"openalex:W2974463220 P10283","xyz:property":"P10283","prov:value":"W2974463220","xyz:as_of":"2026-09-23","xyz:stale":null}},"activity":{"mint:9f97c15152cf":{"prov:type":"mint:Transform","mint:lane":"openalex:20260923","mint:version":null,"mint:version_recorded":false}},"agent":{"xyz:4ort-mint":{"prov:type":"prov:SoftwareAgent","prov:label":"4ort-mint"},"pub:openalex":{"prov:type":"prov:Organization","prov:label":"OpenAlex","xyz:homepage":"https://openalex.org"}},"wasDerivedFrom":{"_:der_9f349add438b":{"prov:generatedEntity":"xyz:fact_01f5f29b3b7b","prov:usedEntity":"lake:openalex_20260923"},"_:der_fbf3763ad6bf":{"prov:generatedEntity":"xyz:fact_968caf916533","prov:usedEntity":"lake:openalex_20260923"},"_:der_30bc73fff1b4":{"prov:generatedEntity":"xyz:fact_618a3c7d11df","prov:usedEntity":"lake:openalex_20260923"},"_:der_904c137cae28":{"prov:generatedEntity":"xyz:fact_cef6b80fddcb","prov:usedEntity":"lake:openalex_20260923"},"_:der_b993cde1fe78":{"prov:generatedEntity":"xyz:fact_79d2b6b19368","prov:usedEntity":"lake:openalex_20260923"}},"wasGeneratedBy":{"_:gen_d0eb97d1914f":{"prov:entity":"xyz:fact_01f5f29b3b7b","prov:activity":"mint:9f97c15152cf"},"_:gen_2e03e62cf7d2":{"prov:entity":"xyz:fact_968caf916533","prov:activity":"mint:9f97c15152cf"},"_:gen_6e2c58e4753c":{"prov:entity":"xyz:fact_618a3c7d11df","prov:activity":"mint:9f97c15152cf"},"_:gen_13f576511543":{"prov:entity":"xyz:fact_cef6b80fddcb","prov:activity":"mint:9f97c15152cf"},"_:gen_5aec214c3c08":{"prov:entity":"xyz:fact_79d2b6b19368","prov:activity":"mint:9f97c15152cf"}},"used":{"_:use_df9f69fba9ff":{"prov:activity":"mint:9f97c15152cf","prov:entity":"lake:openalex_20260923"}},"wasAttributedTo":{"_:att_018d047a42cb":{"prov:entity":"lake:openalex_20260923","prov:agent":"pub:openalex"}},"wasAssociatedWith":{"_:assoc_dffe03817867":{"prov:activity":"mint:9f97c15152cf","prov:agent":"xyz:4ort-mint"}}},"corrections":"https://4ort.xyz/corrections"}