{"id":"https://openalex.org/W1997826608","doi":"https://doi.org/10.1007/s10107-008-0226-9","title":"Lifting inequalities: a framework for generating strong cuts for nonlinear programs","display_name":"Lifting inequalities: a framework for generating strong cuts for nonlinear programs","publication_year":2008,"publication_date":"2008-05-30","ids":{"openalex":"https://openalex.org/W1997826608","doi":"https://doi.org/10.1007/s10107-008-0226-9","mag":"1997826608"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-008-0226-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-008-0226-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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089190845","display_name":"Jean\u2010Philippe P. Richard","orcid":"https://orcid.org/0000-0001-5641-0939"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jean-Philippe P. Richard","raw_affiliation_strings":["School of Industrial Engineering, Purdue University, 315 N. Grant Street, West Lafayette, IN, 47907-2023, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, Purdue University, 315 N. Grant Street, West Lafayette, IN, 47907-2023, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001767041","display_name":"Mohit Tawarmalani","orcid":"https://orcid.org/0000-0003-3085-0084"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohit Tawarmalani","raw_affiliation_strings":["Krannert School of Management, Purdue University, 100 S. Grant Street, West Lafayette, IN, 47907-2076, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Krannert School of Management, Purdue University, 100 S. Grant Street, West Lafayette, IN, 47907-2076, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001767041"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":2.9634,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.89578602,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"121","issue":"1","first_page":"61","last_page":"104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9977999925613403,"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.9977999925613403,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.9800999760627747,"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/mathematics","display_name":"Mathematics","score":0.7707024812698364},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.6302736401557922},{"id":"https://openalex.org/keywords/superadditivity","display_name":"Superadditivity","score":0.629905104637146},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6174671053886414},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5950564742088318},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5920215845108032},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5564466714859009},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5500775575637817},{"id":"https://openalex.org/keywords/bilinear-interpolation","display_name":"Bilinear interpolation","score":0.5422888398170471},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.47752586007118225},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.42745786905288696},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.41233670711517334},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3896799087524414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14145132899284363},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.09603393077850342},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08238276839256287}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7707024812698364},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.6302736401557922},{"id":"https://openalex.org/C20017120","wikidata":"https://www.wikidata.org/wiki/Q922087","display_name":"Superadditivity","level":2,"score":0.629905104637146},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6174671053886414},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5950564742088318},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5920215845108032},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5564466714859009},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5500775575637817},{"id":"https://openalex.org/C205203396","wikidata":"https://www.wikidata.org/wiki/Q612143","display_name":"Bilinear interpolation","level":2,"score":0.5422888398170471},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.47752586007118225},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42745786905288696},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.41233670711517334},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3896799087524414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14145132899284363},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.09603393077850342},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08238276839256287},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-008-0226-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-008-0226-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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1481126596","https://openalex.org/W1503425191","https://openalex.org/W1520007244","https://openalex.org/W1534416612","https://openalex.org/W1549174816","https://openalex.org/W1571070457","https://openalex.org/W1594264634","https://openalex.org/W1778906433","https://openalex.org/W1922855725","https://openalex.org/W1967535666","https://openalex.org/W1968143987","https://openalex.org/W1972997295","https://openalex.org/W1985990685","https://openalex.org/W1988622494","https://openalex.org/W1990585107","https://openalex.org/W1995151259","https://openalex.org/W1998221953","https://openalex.org/W2006934540","https://openalex.org/W2007126271","https://openalex.org/W2008389133","https://openalex.org/W2011130308","https://openalex.org/W2021043398","https://openalex.org/W2029423538","https://openalex.org/W2034186905","https://openalex.org/W2042916461","https://openalex.org/W2049097512","https://openalex.org/W2049143039","https://openalex.org/W2049505431","https://openalex.org/W2064366623","https://openalex.org/W2074522670","https://openalex.org/W2076535438","https://openalex.org/W2081929325","https://openalex.org/W2093022060","https://openalex.org/W2100189126","https://openalex.org/W2107774361","https://openalex.org/W2112538451","https://openalex.org/W2120803616","https://openalex.org/W2124452917","https://openalex.org/W2147609091","https://openalex.org/W2151308681","https://openalex.org/W2167539320","https://openalex.org/W2490340839","https://openalex.org/W2505968561","https://openalex.org/W2517482343","https://openalex.org/W3122954081","https://openalex.org/W3124498598","https://openalex.org/W4251767710","https://openalex.org/W4292175028"],"related_works":["https://openalex.org/W2074134927","https://openalex.org/W4324118942","https://openalex.org/W2913057782","https://openalex.org/W2734993473","https://openalex.org/W2185064329","https://openalex.org/W2187229407","https://openalex.org/W3030201206","https://openalex.org/W2059909660","https://openalex.org/W4302394465","https://openalex.org/W2734242255"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}