{"id":"https://openalex.org/W3042653009","doi":"https://doi.org/10.1007/s10479-020-03722-5","title":"Two linear approximation algorithms for convex mixed integer nonlinear programming","display_name":"Two linear approximation algorithms for convex mixed integer nonlinear programming","publication_year":2020,"publication_date":"2020-07-18","ids":{"openalex":"https://openalex.org/W3042653009","doi":"https://doi.org/10.1007/s10479-020-03722-5","mag":"3042653009"},"language":"en","primary_location":{"id":"doi:10.1007/s10479-020-03722-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10479-020-03722-5","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","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/A5042805770","display_name":"Wendel Melo","orcid":"https://orcid.org/0000-0002-0586-9157"},"institutions":[{"id":"https://openalex.org/I80850581","display_name":"Universidade Federal de Uberl\u00e2ndia","ror":"https://ror.org/04x3wvr31","country_code":"BR","type":"education","lineage":["https://openalex.org/I80850581"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Wendel Melo","raw_affiliation_strings":["College of Computer Science, Federal University of Uberlandia, Uberl\u00e2ndia, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-0586-9157","affiliations":[{"raw_affiliation_string":"College of Computer Science, Federal University of Uberlandia, Uberl\u00e2ndia, Brazil","institution_ids":["https://openalex.org/I80850581"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026754999","display_name":"Marcia Fampa","orcid":"https://orcid.org/0000-0002-6254-1510"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcia Fampa","raw_affiliation_strings":["Institute of Mathematics and COPPE, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and COPPE, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I122140584"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063882754","display_name":"Fernanda M. P. Raupp","orcid":null},"institutions":[{"id":"https://openalex.org/I4210151455","display_name":"Ministry of Science, Technology and Innovation","ror":"https://ror.org/050zdnc69","country_code":"BR","type":"government","lineage":["https://openalex.org/I4210151455"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Fernanda Raupp","raw_affiliation_strings":["National Laboratory for Scientific Computing of the Ministry of Science, Technology, Innovations and Communications, Rio de Janeiro, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Laboratory for Scientific Computing of the Ministry of Science, Technology, Innovations and Communications, Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I4210151455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042805770"],"corresponding_institution_ids":["https://openalex.org/I80850581"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.5469,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6117063,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"316","issue":"2","first_page":"1471","last_page":"1491"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9879000186920166,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9829999804496765,"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/cutting-plane-method","display_name":"Cutting-plane method","score":0.7307511568069458},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6687594056129456},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6304023265838623},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6092292666435242},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5039493441581726},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5030567049980164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4958239495754242},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.49416306614875793},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4937828481197357},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.45821255445480347},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4367560148239136},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43053990602493286},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4295315146446228},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4278463125228882},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4231053292751312},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3793885111808777},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.367838054895401}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7307511568069458},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6687594056129456},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6304023265838623},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6092292666435242},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5039493441581726},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5030567049980164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4958239495754242},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.49416306614875793},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4937828481197357},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.45821255445480347},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4367560148239136},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43053990602493286},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4295315146446228},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4278463125228882},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4231053292751312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3793885111808777},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.367838054895401},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10479-020-03722-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10479-020-03722-5","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:annopr:v:316:y:2022:i:2:d:10.1007_s10479-020-03722-5","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10479-020-03722-5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G11431063","display_name":null,"funder_award_id":"307679/2016-0","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G2003681770","display_name":null,"funder_award_id":"303898/2016-0","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G691919677","display_name":null,"funder_award_id":"434683/2018-3","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W166751945","https://openalex.org/W805566928","https://openalex.org/W1541170979","https://openalex.org/W1570949702","https://openalex.org/W1918578756","https://openalex.org/W1983007923","https://openalex.org/W1987924891","https://openalex.org/W2007231110","https://openalex.org/W2057338659","https://openalex.org/W2061962896","https://openalex.org/W2066875914","https://openalex.org/W2069808690","https://openalex.org/W2071334094","https://openalex.org/W2073135589","https://openalex.org/W2073239458","https://openalex.org/W2095476732","https://openalex.org/W2170213261","https://openalex.org/W2767791580","https://openalex.org/W2789932487","https://openalex.org/W2801755592","https://openalex.org/W2902723719","https://openalex.org/W2904818131","https://openalex.org/W2990714382","https://openalex.org/W3105187766"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W1531708257","https://openalex.org/W2387389269","https://openalex.org/W2109445739","https://openalex.org/W2568448495","https://openalex.org/W3162501176","https://openalex.org/W2110818895","https://openalex.org/W134055995","https://openalex.org/W566167518","https://openalex.org/W2218893665"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}