{"id":"https://openalex.org/W2612378885","doi":null,"title":"\u041c\u0435\u0442\u043e\u0434 \u043e\u0442\u0441\u0435\u0447\u0435\u043d\u0438\u0439 \u0441 \u043e\u0431\u043d\u043e\u0432\u043b\u0435\u043d\u0438\u0435\u043c \u0430\u043f\u043f\u0440\u043e\u043a\u0441\u0438\u043c\u0438\u0440\u0443\u044e\u0449\u0438\u0445 \u043c\u043d\u043e\u0436\u0435\u0441\u0442\u0432 \u0438 \u0435\u0433\u043e \u043a\u043e\u043c\u0431\u0438\u043d\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u0441 \u0434\u0440\u0443\u0433\u0438\u043c\u0438\u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u0430\u043c\u0438","display_name":"\u041c\u0435\u0442\u043e\u0434 \u043e\u0442\u0441\u0435\u0447\u0435\u043d\u0438\u0439 \u0441 \u043e\u0431\u043d\u043e\u0432\u043b\u0435\u043d\u0438\u0435\u043c \u0430\u043f\u043f\u0440\u043e\u043a\u0441\u0438\u043c\u0438\u0440\u0443\u044e\u0449\u0438\u0445 \u043c\u043d\u043e\u0436\u0435\u0441\u0442\u0432 \u0438 \u0435\u0433\u043e \u043a\u043e\u043c\u0431\u0438\u043d\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u0441 \u0434\u0440\u0443\u0433\u0438\u043c\u0438\u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u0430\u043c\u0438","alternate_titles":[],"publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2612378885","mag":"2612378885"},"language":"ru","primary_location":{"id":"mag:2612378885","doi":null,"is_oa":false,"landing_page_url":"https://cyberleninka.ru/article/n/metod-otsecheniy-s-obnovleniem-approksimiruyuschih-mnozhestv-i-ego-kombinirovanie-s-drugimialgoritmami","pdf_url":null,"source":{"id":"https://openalex.org/S4306401404","display_name":"CyberLeninK (CyberLeninka)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\u0418\u0437\u0432\u0435\u0441\u0442\u0438\u044f \u0418\u0440\u043a\u0443\u0442\u0441\u043a\u043e\u0433\u043e \u0433\u043e\u0441\u0443\u0434\u0430\u0440\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0433\u043e \u0443\u043d\u0438\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0430. \u0421\u0435\u0440\u0438\u044f: \u041c\u0430\u0442\u0435\u043c\u0430\u0442\u0438\u043a\u0430","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2612378885"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086708155","display_name":"I. Ya. Zabotin","orcid":"https://orcid.org/0000-0002-8177-4790","observed_orcids":["https://orcid.org/0000-0002-8177-4790"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u0417\u0430\u0431\u043e\u0442\u0438\u043d \u0418\u0433\u043e\u0440\u044c \u042f\u0440\u043e\u0441\u043b\u0430\u0432\u0438\u0447","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5043658429","display_name":"\u042f\u0440\u0443\u043b\u043b\u0438\u043d \u0420\u0430\u0448\u0438\u0434 \u0421\u0430\u043c\u0430\u0442\u043e\u0432\u0438\u0447","orcid":"https://orcid.org/0000-0003-1346-6611","observed_orcids":["https://orcid.org/0000-0003-1346-6611"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u042f\u0440\u0443\u043b\u043b\u0438\u043d \u0420\u0430\u0448\u0438\u0434 \u0421\u0430\u043c\u0430\u0442\u043e\u0432\u0438\u0447","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":92},"biblio":{"volume":"10","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.573199987411499,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.573199987411499,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2863999903202057,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.02370000071823597,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"cutting plane method","score":0.8510000109672546},{"id":"https://openalex.org/keywords/approximation-sets","display_name":"approximation sets","score":0.7229999899864197},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.6629999876022339}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33174651861190796}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2612378885","doi":null,"is_oa":false,"landing_page_url":"https://cyberleninka.ru/article/n/metod-otsecheniy-s-obnovleniem-approksimiruyuschih-mnozhestv-i-ego-kombinirovanie-s-drugimialgoritmami","pdf_url":null,"source":{"id":"https://openalex.org/S4306401404","display_name":"CyberLeninK (CyberLeninka)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\u0418\u0437\u0432\u0435\u0441\u0442\u0438\u044f \u0418\u0440\u043a\u0443\u0442\u0441\u043a\u043e\u0433\u043e \u0433\u043e\u0441\u0443\u0434\u0430\u0440\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0433\u043e \u0443\u043d\u0438\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0430. \u0421\u0435\u0440\u0438\u044f: \u041c\u0430\u0442\u0435\u043c\u0430\u0442\u0438\u043a\u0430","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2915570266","https://openalex.org/W4409568149","https://openalex.org/W2742243639","https://openalex.org/W379560293","https://openalex.org/W7016326763","https://openalex.org/W3000101988","https://openalex.org/W2747740069","https://openalex.org/W7128410432","https://openalex.org/W3162616349","https://openalex.org/W7223509888"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2612378885","counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2017-05-19T00:00:00"}
