{"id":"https://openalex.org/W1967485231","doi":"https://doi.org/10.1007/bf01581048","title":"An accelerated covering relaxation algorithm for solving 0\u20131 positive polynomial programs","display_name":"An accelerated covering relaxation algorithm for solving 0\u20131 positive polynomial programs","publication_year":1982,"publication_date":"1982-12-01","ids":{"openalex":"https://openalex.org/W1967485231","doi":"https://doi.org/10.1007/bf01581048","mag":"1967485231"},"language":"en","primary_location":{"id":"doi:10.1007/bf01581048","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01581048","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","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/A5081368387","display_name":"Daniel Granot","orcid":"https://orcid.org/0000-0001-5779-1032"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Daniel Granot","raw_affiliation_strings":["Faculty of Commerce, University of British Columbia, Vancouver, B.C., Canada","Faculty of Commerce, University of British Columbia, Vancouver, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Commerce, University of British Columbia, Vancouver, B.C., Canada","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"Faculty of Commerce, University of British Columbia, Vancouver, Canada#TAB#","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030418998","display_name":"Frieda Granot","orcid":"https://orcid.org/0000-0002-7083-919X"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Frieda Granot","raw_affiliation_strings":["Faculty of Commerce, University of British Columbia, Vancouver, B.C., Canada","Faculty of Commerce, University of British Columbia, Vancouver, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Commerce, University of British Columbia, Vancouver, B.C., Canada","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"Faculty of Commerce, University of British Columbia, Vancouver, Canada#TAB#","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004871097","display_name":"Willem Vaessen","orcid":null},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Willem Vaessen","raw_affiliation_strings":["Computer Science Department, University of British Columbia, Vancouver, B.C., Canada","Computer Science Department, University of British Columbia, Vancouver, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of British Columbia, Vancouver, B.C., Canada","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"Computer Science Department, University of British Columbia, Vancouver, Canada#TAB#","institution_ids":["https://openalex.org/I141945490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.1531,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.90881226,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"22","issue":"1","first_page":"350","last_page":"357"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9976999759674072,"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.9976999759674072,"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/T12176","display_name":"Optimization and Packing Problems","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.7330084443092346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.69671630859375},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.6289764046669006},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5938174724578857},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5831718444824219},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5723243355751038},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5331358909606934},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5218866467475891},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5012068748474121},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4921266436576843},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4783881902694702},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.46758174896240234},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.44071653485298157},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4358949661254883},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19774538278579712},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.1599777340888977},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14054393768310547},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06321769952774048}],"concepts":[{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.7330084443092346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.69671630859375},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.6289764046669006},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5938174724578857},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5831718444824219},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5723243355751038},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5331358909606934},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5218866467475891},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5012068748474121},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4921266436576843},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4783881902694702},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.46758174896240234},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.44071653485298157},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4358949661254883},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19774538278579712},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.1599777340888977},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14054393768310547},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06321769952774048},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01581048","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01581048","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:ADA089620","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA089620","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,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1967485231","https://openalex.org/W1988658005","https://openalex.org/W2100890245","https://openalex.org/W2154549480","https://openalex.org/W2158446314","https://openalex.org/W4243727645"],"related_works":["https://openalex.org/W3006241023","https://openalex.org/W2028438572","https://openalex.org/W1581805909","https://openalex.org/W1589381382","https://openalex.org/W961142965","https://openalex.org/W2123652094","https://openalex.org/W4301650009","https://openalex.org/W2106792385","https://openalex.org/W2046723224","https://openalex.org/W2949321111"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}