{"id":"https://openalex.org/W4319322625","doi":"https://doi.org/10.5802/ojmo.43","title":"Learning structured approximations of combinatorial optimization problems","display_name":"Learning structured approximations of combinatorial optimization problems","publication_year":2025,"publication_date":"2025-12-02","ids":{"openalex":"https://openalex.org/W4319322625","doi":"https://doi.org/10.5802/ojmo.43"},"language":"en","primary_location":{"id":"doi:10.5802/ojmo.43","is_oa":true,"landing_page_url":"https://doi.org/10.5802/ojmo.43","pdf_url":"https://ojmo.centre-mersenne.org/item/10.5802/ojmo.43.pdf","source":{"id":"https://openalex.org/S4210238298","display_name":"Open Journal of Mathematical Optimization","issn_l":"2777-5860","issn":["2777-5860"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310311164","host_organization_name":"University of Montpellier","host_organization_lineage":["https://openalex.org/P4310311164"],"host_organization_lineage_names":["University of Montpellier"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Journal of Mathematical Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojmo.centre-mersenne.org/item/10.5802/ojmo.43.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016280438","display_name":"Axel Parmentier","orcid":"https://orcid.org/0000-0003-1762-4947"},"institutions":[{"id":"https://openalex.org/I142631665","display_name":"\u00c9cole nationale des ponts et chauss\u00e9es","ror":"https://ror.org/02nwvxz07","country_code":"FR","type":"education","lineage":["https://openalex.org/I142631665","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210128309","display_name":"CERMICS","ror":"https://ror.org/03wct8w46","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210128309","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Axel Parmentier","raw_affiliation_strings":["CERMICS, ENPC, Institut Polytechnique de Paris, Marne-la-Vall\u00e9e, France","Centre d'Enseignement et de Recherche en Math\u00e9matiques et Calcul Scientifique"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CERMICS, ENPC, Institut Polytechnique de Paris, Marne-la-Vall\u00e9e, France","institution_ids":["https://openalex.org/I142631665","https://openalex.org/I4210128309"]},{"raw_affiliation_string":"Centre d'Enseignement et de Recherche en Math\u00e9matiques et Calcul Scientifique","institution_ids":["https://openalex.org/I4210128309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016280438"],"corresponding_institution_ids":["https://openalex.org/I142631665","https://openalex.org/I4210128309"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00278366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.8996000289916992,"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"}},"topics":[{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.8996000289916992,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.8242999911308289,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10050","display_name":"Multi-Criteria Decision Making","score":0.7993999719619751,"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/approximations-of-\u03c0","display_name":"Approximations of \u03c0","score":0.5444496870040894},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49870753288269043},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4809809923171997},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43668678402900696},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33759263157844543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3263552784919739},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.23409083485603333}],"concepts":[{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.5444496870040894},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49870753288269043},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4809809923171997},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43668678402900696},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33759263157844543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3263552784919739},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.23409083485603333}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5802/ojmo.43","is_oa":true,"landing_page_url":"https://doi.org/10.5802/ojmo.43","pdf_url":"https://ojmo.centre-mersenne.org/item/10.5802/ojmo.43.pdf","source":{"id":"https://openalex.org/S4210238298","display_name":"Open Journal of Mathematical Optimization","issn_l":"2777-5860","issn":["2777-5860"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310311164","host_organization_name":"University of Montpellier","host_organization_lineage":["https://openalex.org/P4310311164"],"host_organization_lineage_names":["University of Montpellier"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Journal of Mathematical Optimization","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.5802/ojmo.43","is_oa":true,"landing_page_url":"https://doi.org/10.5802/ojmo.43","pdf_url":"https://ojmo.centre-mersenne.org/item/10.5802/ojmo.43.pdf","source":{"id":"https://openalex.org/S4210238298","display_name":"Open Journal of Mathematical Optimization","issn_l":"2777-5860","issn":["2777-5860"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310311164","host_organization_name":"University of Montpellier","host_organization_lineage":["https://openalex.org/P4310311164"],"host_organization_lineage_names":["University of Montpellier"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Journal of Mathematical Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4319322625.pdf","grobid_xml":"https://content.openalex.org/works/W4319322625.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W2026682089","https://openalex.org/W2086379185","https://openalex.org/W2111296615","https://openalex.org/W2113741278","https://openalex.org/W2994967491","https://openalex.org/W2998274290","https://openalex.org/W3047863327","https://openalex.org/W3136027957","https://openalex.org/W3171756615","https://openalex.org/W3189470799","https://openalex.org/W4206733017","https://openalex.org/W4255654664","https://openalex.org/W4283522503"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"Neural":[0],"networks":[1],"that":[2,88],"include":[3],"a":[4,85,129,139],"combinatorial":[5,16],"optimization":[6,17,104],"layer":[7],"can":[8,43,148],"give":[9],"surprisingly":[10],"efficient":[11],"heuristic":[12],"policies":[13,93],"for":[14,155],"difficult":[15,103],"problems.":[18],"Three":[19],"questions":[20],"remain":[21],"open:":[22],"which":[23],"architecture":[24],"should":[25,29,62],"be":[26,37,63,149],"used,":[27],"how":[28,71],"the":[30,33,47,51,95,102,132,136,152,159,164,178,183,189,193],"parameters":[31],"of":[32,53,101,135,182,192],"machine":[34,174],"learning":[35,86,125,175],"model":[36],"learned,":[38],"and":[39,69,79,106,111,188],"what":[40],"performance":[41,115],"guarantees":[42],"we":[44,57,127,141],"expect":[45],"from":[46,123],"resulting":[48],"algorithms?":[49],"Following":[50],"intuitions":[52],"geometric":[54],"deep":[55],"learning,":[56],"explain":[58],"why":[59],"equivariant":[60],"layers":[61,75],"used":[64],"when":[65,94],"designing":[66],"such":[67,74,92],"policies,":[68],"illustrate":[70],"to":[72,90],"build":[73],"on":[76,116],"routing,":[77],"scheduling,":[78],"network":[80,154,170],"design":[81,171],"applications.":[82,119],"We":[83],"introduce":[84],"approach":[87],"enables":[89],"learn":[91],"training":[96],"set":[97],"contains":[98],"only":[99],"instances":[100],"problem":[105],"not":[107],"their":[108],"optimal":[109],"solutions,":[110],"show":[112],"its":[113],"numerical":[114,190],"our":[117,169,173],"three":[118],"Finally,":[120],"using":[121],"tools":[122],"statistical":[124],"theory,":[126],"prove":[128],"theorem":[130],"showing":[131],"convergence":[133],"speed":[134],"estimator.":[137],"As":[138],"corollary,":[140],"obtain":[142],"that,":[143],"if":[144],"an":[145],"approximation":[146,165,179,185],"algorithm":[147,186],"encoded":[150],"by":[151],"neural":[153],"some":[156],"parametrization,":[157],"then":[158],"learned":[160],"policy":[161,176],"will":[162],"retain":[163],"ratio":[166,180],"guarantee.":[167],"On":[168],"problem,":[172],"has":[177],"guarantee":[181],"best":[184,194],"known":[187],"efficiency":[191],"heuristic.":[195]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2023-02-08T00:00:00"}
