{"id":"https://openalex.org/W279804368","doi":"https://doi.org/10.21236/ada234961","title":"Converting a Converging Algorithm into a Polynomially Bounded Algorithm","display_name":"Converting a Converging Algorithm into a Polynomially Bounded Algorithm","alternate_titles":[],"publication_year":1991,"publication_date":"1991-03-01","ids":{"openalex":"https://openalex.org/W279804368","doi":"https://doi.org/10.21236/ada234961","mag":"279804368"},"language":"en","primary_location":{"id":"doi:10.21236/ada234961","doi":"https://doi.org/10.21236/ada234961","is_oa":false,"landing_page_url":"https://doi.org/10.21236/ada234961","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"US Dept of the Navy","raw_type":"report"},"parent_works":[],"lineage":["https://openalex.org/W279804368"],"child_works_count":0,"type":"report","is_traditional":false,"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/A5070947764","display_name":"George B. Dantzig","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"George B. Dantzig","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5070947764"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":26,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"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.7085000276565552,"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.7085000276565552,"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.2741999924182892,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.009399999864399433,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.6930000185966492},{"id":"https://openalex.org/keywords/convexity-constraints","display_name":"convexity constraints","score":0.7789999842643738},{"id":"https://openalex.org/keywords/linear-programming-algorithms","display_name":"linear programming algorithms","score":0.3880000114440918}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7213559150695801},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5868738889694214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5000708103179932},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3052259087562561},{"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.21236/ada234961","doi":"https://doi.org/10.21236/ada234961","is_oa":false,"landing_page_url":"https://doi.org/10.21236/ada234961","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"US Dept of the Navy","raw_type":"report"}],"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/W2554116915","https://openalex.org/W2016937181","https://openalex.org/W7095300447","https://openalex.org/W6959596708","https://openalex.org/W2240673064","https://openalex.org/W2362494314","https://openalex.org/W2737174541","https://openalex.org/W2355679958","https://openalex.org/W7097501309","https://openalex.org/W2107244608"],"abstract_inverted_index":{"This":[0],"document":[1],"considers":[2],"a":[3,12],"certain":[4,24],"general":[5],"Phase":[6],"1":[7],"linear":[8],"programming":[9],"problem":[10],"with":[11],"convexity":[13],"constraint":[14],"which":[15],"can":[16],"be":[17],"written":[18],"after":[19],"some":[20],"algebraic":[21],"manipulation":[22],"in":[23],"form.":[25]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W279804368","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2013,"cited_by_count":4}],"updated_date":"2026-11-22T12:46:00.618207","created_date":"2016-06-24T00:00:00"}
