{"id":"https://openalex.org/W133898461","doi":null,"title":"Reformulations in Mathematical Programming: Definitions.","display_name":"Reformulations in Mathematical Programming: Definitions.","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W133898461","mag":"133898461"},"language":"en","primary_location":{"id":"mag:133898461","doi":null,"is_oa":false,"landing_page_url":"https://www.enseignement.polytechnique.fr/profs/informatique/Leo.Liberti/refdef-extabstract.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306417910","display_name":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W133898461"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5046138085","display_name":"Leo Liberti","orcid":"https://orcid.org/0000-0003-3139-6821","observed_orcids":["https://orcid.org/0000-0003-3139-6821","https://orcid.org/0000-0002-9943-7645"]},"institutions":[{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Leo Liberti","raw_affiliation_strings":["Ecole Polytechnique"],"raw_orcid":"https://orcid.org/0000-0003-3139-6821","affiliations":[{"raw_affiliation_string":"Ecole Polytechnique","institution_ids":["https://openalex.org/I142476485"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046138085"],"corresponding_institution_ids":["https://openalex.org/I142476485"],"apc_list":null,"apc_paid":null,"fwci":5.1143,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.94946809,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"66","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9018999934196472,"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.9018999934196472,"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.08299999684095383,"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.0031999999191612005,"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/reformulation","display_name":"reformulation","score":0.7379999756813049},{"id":"https://openalex.org/keywords/optimization-problem-formulation","display_name":"optimization problem formulation","score":0.6620000004768372},{"id":"https://openalex.org/keywords/equivalent-formulations","display_name":"equivalent formulations","score":0.6510000228881836},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"nonlinear programming","score":0.4959999918937683},{"id":"https://openalex.org/keywords/integer-programming","display_name":"integer programming","score":0.7020000219345093},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.7059999704360962},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9120000004768372}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6861807107925415},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.6383103132247925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6226865649223328},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5873942375183105},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5109230875968933},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5027706623077393},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4750792384147644},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.46911197900772095},{"id":"https://openalex.org/C66783780","wikidata":"https://www.wikidata.org/wiki/Q1166625","display_name":"Mathematical problem","level":2,"score":0.4508377015590668},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3513326048851013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2919798493385315},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18768033385276794},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:133898461","doi":null,"is_oa":false,"landing_page_url":"https://www.enseignement.polytechnique.fr/profs/informatique/Leo.Liberti/refdef-extabstract.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306417910","display_name":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W167974833","https://openalex.org/W1503428021","https://openalex.org/W2030485731","https://openalex.org/W2058582911","https://openalex.org/W2242422634","https://openalex.org/W2914155449"],"related_works":["https://openalex.org/W2100581751","https://openalex.org/W4292447629","https://openalex.org/W1825288209","https://openalex.org/W7095568332","https://openalex.org/W7097080788","https://openalex.org/W185653072","https://openalex.org/W2112787288","https://openalex.org/W4211239775","https://openalex.org/W2799265329","https://openalex.org/W2283763310"],"abstract_inverted_index":{"The":[0],"mathematical":[1,44,73],"programming":[2,45,74],"formulation":[3],"language":[4,85],"is":[5,49,100],"a":[6],"very":[7],"powerful":[8],"tool":[9],"used":[10],"to":[11,52,91,122,128],"formalize":[12],"optimization":[13,35,68,96],"problems":[14,36,69,97],"by":[15,41],"means":[16],"of":[17,60,118],"parameters,":[18],"decision":[19],"variables,":[20],"objective":[21],"functions":[22],"and":[23,33,76,93],"constraints.":[24],"Such":[25],"diverse":[26],"settings":[27],"as":[28],"combinatorial,":[29],"integer,":[30],"continuous,":[31],"linear":[32],"nonlinear":[34],"can":[37,80],"be":[38,82],"defined":[39],"precisely":[40],"their":[42,72],"corresponding":[43,78],"formulations.":[46],"Its":[47],"power":[48],"not":[50],"limited":[51],"its":[53],"expressiveness,":[54],"but":[55],"usually":[56,81],"allows":[57],"hasslefree":[58],"solution":[59,65],"the":[61,77,89,109,129],"problem:":[62],"most":[63,130],"general-purpose":[64],"algorithms":[66],"solve":[67,94,123],"cast":[70],"in":[71],"formulation,":[75],"implementations":[79],"hooked":[83],"into":[84],"environments":[86],"which":[87],"allow":[88],"user":[90],"input":[92],"complex":[95],"easily.":[98],"It":[99],"well":[101],"known":[102],"that":[103],"several":[104],"dierent":[105],"formulations":[106],"may":[107],"share":[108],"same":[110],"numerical":[111],"properties":[112],"(feasible":[113],"region,":[114],"optima)":[115],"though":[116],"some":[117],"them":[119],"are":[120],"easier":[121],"than":[124],"others":[125],"with":[126],"respect":[127],"ecient":[131]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-10-13T10:08:12.033832","created_date":"2016-06-24T00:00:00"}