{"id":"https://openalex.org/W1988815259","doi":"https://doi.org/10.1007/s10107-015-0870-9","title":"A dynamic inequality generation scheme for polynomial programming","display_name":"A dynamic inequality generation scheme for polynomial programming","publication_year":2015,"publication_date":"2015-03-03","ids":{"openalex":"https://openalex.org/W1988815259","doi":"https://doi.org/10.1007/s10107-015-0870-9","mag":"1988815259"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-015-0870-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-015-0870-9","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":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/1fdeff40-0647-4996-bfdf-44b99734252e","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084563518","display_name":"Bissan Ghaddar","orcid":"https://orcid.org/0000-0003-4695-200X"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210144925","display_name":"Technological University Dublin","ror":"https://ror.org/04t0qbt32","country_code":"IE","type":"education","lineage":["https://openalex.org/I4210144925"]}],"countries":["IE","US"],"is_corresponding":true,"raw_author_name":"Bissan Ghaddar","raw_affiliation_strings":["IBM Research, Dublin Technology Campus, Damastown Ind. Park, Mulhuddart, 15, Dublin, Ireland","IBM Research, Dublin Technology Campus, Mulhuddart, Ireland 15#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM Research, Dublin Technology Campus, Damastown Ind. Park, Mulhuddart, 15, Dublin, Ireland","institution_ids":["https://openalex.org/I4210144925"]},{"raw_affiliation_string":"IBM Research, Dublin Technology Campus, Mulhuddart, Ireland 15#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002345780","display_name":"Juan C. Vera","orcid":"https://orcid.org/0000-0003-1394-3422"},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Juan C. Vera","raw_affiliation_strings":["Tilburg School of Economics and Management, Tilburg University, Tilburg, The Netherlands","Tilburg School of Economics and Management, Tilburg University, Tilburg, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Tilburg School of Economics and Management, Tilburg University, Tilburg, The Netherlands","institution_ids":["https://openalex.org/I193700539"]},{"raw_affiliation_string":"Tilburg School of Economics and Management, Tilburg University, Tilburg, The Netherlands#TAB#","institution_ids":["https://openalex.org/I193700539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005540131","display_name":"Miguel F. Anjos","orcid":"https://orcid.org/0000-0002-8258-9116"},"institutions":[{"id":"https://openalex.org/I45683168","display_name":"Polytechnique Montr\u00e9al","ror":"https://ror.org/05f8d4e86","country_code":"CA","type":"education","lineage":["https://openalex.org/I45683168"]},{"id":"https://openalex.org/I4210133247","display_name":"Group for Research in Decision Analysis","ror":"https://ror.org/02pkvpx84","country_code":"CA","type":"facility","lineage":["https://openalex.org/I108192572","https://openalex.org/I159129438","https://openalex.org/I4210133247","https://openalex.org/I45683168","https://openalex.org/I49663120","https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Miguel F. Anjos","raw_affiliation_strings":["Canada Research Chair in Discrete Nonlinear Optimization in Engineering, GERAD and \u00c9cole Polytechnique de Montr\u00e9al, Montr\u00e9al, QC, H3C 3A7, Canada","Canada Research Chair in Discrete Nonlinear Optimization in Engineering, GERAD and \u00c9cole Polytechnique de Montr\u00e9al, Montreal, Canada H3C 3A7#TAB#"],"affiliations":[{"raw_affiliation_string":"Canada Research Chair in Discrete Nonlinear Optimization in Engineering, GERAD and \u00c9cole Polytechnique de Montr\u00e9al, Montr\u00e9al, QC, H3C 3A7, Canada","institution_ids":["https://openalex.org/I45683168","https://openalex.org/I4210133247"]},{"raw_affiliation_string":"Canada Research Chair in Discrete Nonlinear Optimization in Engineering, GERAD and \u00c9cole Polytechnique de Montr\u00e9al, Montreal, Canada H3C 3A7#TAB#","institution_ids":["https://openalex.org/I45683168"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084563518"],"corresponding_institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I4210144925"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.5183,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.80859452,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"156","issue":"1-2","first_page":"21","last_page":"57"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.991599977016449,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9872000217437744,"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/mathematics","display_name":"Mathematics","score":0.7407540082931519},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6166332960128784},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5498740673065186},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5386211276054382},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5250879526138306},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49738457798957825},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.491416335105896},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3694523572921753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33237728476524353}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7407540082931519},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6166332960128784},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5498740673065186},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5386211276054382},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5250879526138306},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49738457798957825},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.491416335105896},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3694523572921753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33237728476524353},{"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/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10107-015-0870-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-015-0870-9","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:oai:pure.ed.ac.uk:openaire/1fdeff40-0647-4996-bfdf-44b99734252e","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/1fdeff40-0647-4996-bfdf-44b99734252e","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ghaddar, B, Vera, J C & Anjos, M F 2016, 'A dynamic inequality generation scheme for polynomial programming', Mathematical programming, vol. 156, no. 1-2, pp. 21-57. https://doi.org/10.1007/s10107-015-0870-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:tilburguniversity.edu:openaire_cris_publications/6b2846e3-5527-4462-b172-6fe9f1621e23","is_oa":false,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/6b2846e3-5527-4462-b172-6fe9f1621e23","pdf_url":null,"source":{"id":"https://openalex.org/S4306401490","display_name":"Research portal (Tilburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193700539","host_organization_name":"Tilburg University","host_organization_lineage":["https://openalex.org/I193700539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ghaddar, B, Vera, J C & Anjos, M F 2016, 'A dynamic inequality generation scheme for polynomial programming', Mathematical Programming, vol. 156, no. 1, pp. 21-57. https://doi.org/10.1007/s10107-015-0870-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:publications.polymtl.ca:34344","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/34344/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"},{"id":"pmh:oai:pure.ed.ac.uk:publications/1fdeff40-0647-4996-bfdf-44b99734252e","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/a-dynamic-inequality-generation-scheme-for-polynomial-programming(1fdeff40-0647-4996-bfdf-44b99734252e).html","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/1fdeff40-0647-4996-bfdf-44b99734252e","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/1fdeff40-0647-4996-bfdf-44b99734252e","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ghaddar, B, Vera, J C & Anjos, M F 2016, 'A dynamic inequality generation scheme for polynomial programming', Mathematical programming, vol. 156, no. 1-2, pp. 21-57. https://doi.org/10.1007/s10107-015-0870-9","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W91728630","https://openalex.org/W572922989","https://openalex.org/W1525062912","https://openalex.org/W1564596346","https://openalex.org/W1965094948","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1970193303","https://openalex.org/W1986175898","https://openalex.org/W1997672673","https://openalex.org/W2030613721","https://openalex.org/W2035949967","https://openalex.org/W2049087128","https://openalex.org/W2049143039","https://openalex.org/W2055993677","https://openalex.org/W2059380806","https://openalex.org/W2074448783","https://openalex.org/W2076535438","https://openalex.org/W2077397558","https://openalex.org/W2082782506","https://openalex.org/W2084148362","https://openalex.org/W2085045434","https://openalex.org/W2094995801","https://openalex.org/W2106264302","https://openalex.org/W2116827925","https://openalex.org/W2120146316","https://openalex.org/W2124038748","https://openalex.org/W2133404041","https://openalex.org/W2133602590","https://openalex.org/W2138322123","https://openalex.org/W2140214428","https://openalex.org/W2162579105","https://openalex.org/W2165281529","https://openalex.org/W2188609405","https://openalex.org/W2473711771","https://openalex.org/W2495457432","https://openalex.org/W2551881024","https://openalex.org/W2962725330","https://openalex.org/W4206054519","https://openalex.org/W4255442211"],"related_works":["https://openalex.org/W2381295697","https://openalex.org/W2385886188","https://openalex.org/W2092089517","https://openalex.org/W2378309693","https://openalex.org/W1788812054","https://openalex.org/W2288891047","https://openalex.org/W3166939022","https://openalex.org/W1520074457","https://openalex.org/W2024507128","https://openalex.org/W1974377567"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}