{"id":"https://openalex.org/W2005133368","doi":"https://doi.org/10.1134/s1995423910020035","title":"Strongly polynomial algorithm for solving the general problem of least modules","display_name":"Strongly polynomial algorithm for solving the general problem of least modules","publication_year":2010,"publication_date":"2010-04-01","ids":{"openalex":"https://openalex.org/W2005133368","doi":"https://doi.org/10.1134/s1995423910020035","mag":"2005133368"},"language":"en","primary_location":{"id":"doi:10.1134/s1995423910020035","doi":"https://doi.org/10.1134/s1995423910020035","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s1995423910020035","pdf_url":null,"source":{"id":"https://openalex.org/S2259906","display_name":"Numerical Analysis and Applications","issn_l":"1560-7526","issn":["1560-7526","1995-4239","1995-4247"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["dongbi-c","norway-1","poland-20","russia-white-list-1","russia-white-list-3"],"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Analysis and Applications","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2005133368"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"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/A5020702291","display_name":"Valentin V. Mironov","orcid":"https://orcid.org/0000-0003-1651-4893","observed_orcids":["https://orcid.org/0000-0003-1651-4893"]},"institutions":[{"id":"https://openalex.org/I4210149385","display_name":"Ryazan State Radio Engineering University","ror":"https://ror.org/04y34yk39","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210149385"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"V. V. Mironov","raw_affiliation_strings":["Ryazan State Radiotechnical University, ul. Gagarina 59/1, Ryazan, 390005, Russia","Ryazan State Radiotechnical University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ryazan State Radiotechnical University, ul. Gagarina 59/1, Ryazan, 390005, Russia","institution_ids":["https://openalex.org/I4210149385"]},{"raw_affiliation_string":"Ryazan State Radiotechnical University","institution_ids":["https://openalex.org/I4210149385"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020702291"],"corresponding_institution_ids":["https://openalex.org/I4210149385"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"2","first_page":"133","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5195000171661377,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5195000171661377,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.38429999351501465,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.05090000107884407,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/strongly-polynomial-algorithms","display_name":"strongly polynomial algorithms","score":0.9120000004768372},{"id":"https://openalex.org/keywords/least-absolute-deviation","display_name":"least absolute deviation","score":0.6650000214576721},{"id":"https://openalex.org/keywords/linear-constraints","display_name":"linear constraints","score":0.7070000171661377},{"id":"https://openalex.org/keywords/equality-constraints","display_name":"equality constraints","score":0.6200000047683716},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.5130000114440918},{"id":"https://openalex.org/keywords/polynomial-time-complexity","display_name":"polynomial complexity","score":0.5210000276565552},{"id":"https://openalex.org/keywords/explicit-algorithm","display_name":"explicit algorithm","score":0.7129999995231628}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6820112466812134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6455156207084656},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5451431274414062},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5001304149627686},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45304301381111145},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3738660216331482},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1134/s1995423910020035","doi":"https://doi.org/10.1134/s1995423910020035","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s1995423910020035","pdf_url":null,"source":{"id":"https://openalex.org/S2259906","display_name":"Numerical Analysis and Applications","issn_l":"1560-7526","issn":["1560-7526","1995-4239","1995-4247"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["dongbi-c","norway-1","poland-20","russia-white-list-1","russia-white-list-3"],"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Analysis and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1979740015","https://openalex.org/W2014528086","https://openalex.org/W2044413922","https://openalex.org/W2080063509","https://openalex.org/W3143335702"],"related_works":["https://openalex.org/W6996723746","https://openalex.org/W1501168133","https://openalex.org/W6959596708","https://openalex.org/W1810525124","https://openalex.org/W2956627755","https://openalex.org/W2282762060","https://openalex.org/W2033040247","https://openalex.org/W2103985627","https://openalex.org/W2783772027","https://openalex.org/W2072478883"],"abstract_inverted_index":{"An":[0],"algorithm":[1,40,51],"of":[2,15,23,25,27,49],"polynomial":[3,8],"algebraic":[4],"complexity":[5,48],"(a":[6],"strongly":[7],"algorithm)":[9],"for":[10],"solving":[11],"the":[12,20,50],"classical":[13],"problem":[14],"mathematical":[16],"programming":[17],"on":[18,34],"minimizing":[19],"weighted":[21],"sum":[22],"modules":[24],"part":[26],"variables":[28],"with":[29],"linear":[30],"constraints":[31],"(equalities":[32],"imposed":[33],"all":[35],"variables)":[36],"is":[37,41,52,56],"substantiated.":[38],"The":[39,47],"given":[42],"in":[43],"its":[44],"explicit":[45],"form.":[46],"estimated.":[53],"A":[54],"simulation":[55],"performed.":[57]},"counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}