{"id":"https://openalex.org/W1980379820","doi":"https://doi.org/10.1137/110840868","title":"A Strong Dual for Conic Mixed-Integer Programs","display_name":"A Strong Dual for Conic Mixed-Integer Programs","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1980379820","doi":"https://doi.org/10.1137/110840868","mag":"1980379820"},"language":"en","primary_location":{"id":"doi:10.1137/110840868","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110840868","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5012506194","display_name":"Diego A. Mor\u00e1n R.","orcid":"https://orcid.org/0000-0002-2510-0433"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Diego A. Mor\u00e1n R.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051547862","display_name":"Santanu S. Dey","orcid":"https://orcid.org/0000-0003-0294-8287"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Santanu S. Dey","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5008961628","display_name":"Juan Pablo Vielma","orcid":"https://orcid.org/0000-0003-4335-7248"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Juan Pablo Vielma","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.9434,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.96178395,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"22","issue":"3","first_page":"1136","last_page":"1150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9975000023841858,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9966999888420105,"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.9789999723434448,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.761737585067749},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7539297342300415},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.7223918437957764},{"id":"https://openalex.org/keywords/subadditivity","display_name":"Subadditivity","score":0.6897509098052979},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6518304944038391},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5359542965888977},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5147647857666016},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.5095746517181396},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4846811592578888},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.41938599944114685},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.332356333732605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09443232417106628},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.05885690450668335},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.045886486768722534}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.761737585067749},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7539297342300415},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.7223918437957764},{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.6897509098052979},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6518304944038391},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5359542965888977},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5147647857666016},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.5095746517181396},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4846811592578888},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.41938599944114685},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.332356333732605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09443232417106628},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.05885690450668335},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.045886486768722534},{"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/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/110840868","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110840868","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.416.3211","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.3211","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2011/07/3096.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.728.1930","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.728.1930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.isye.gatech.edu/%7Esdey30/paper_conic_duality_siam_v9.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W36169824","https://openalex.org/W115265587","https://openalex.org/W132826041","https://openalex.org/W186788842","https://openalex.org/W1568307856","https://openalex.org/W1968143987","https://openalex.org/W2026222212","https://openalex.org/W2027551342","https://openalex.org/W2080875922","https://openalex.org/W3100131142","https://openalex.org/W4245545442"],"related_works":["https://openalex.org/W3199026565","https://openalex.org/W4323321439","https://openalex.org/W4309631170","https://openalex.org/W3124564720","https://openalex.org/W2952330476","https://openalex.org/W2180827833","https://openalex.org/W4293777484","https://openalex.org/W2588229150","https://openalex.org/W2031269429","https://openalex.org/W2047688435"],"abstract_inverted_index":{"Mixed-integer":[0],"conic":[1,61,72],"programming":[2,24,73],"is":[3],"a":[4,67,76],"generalization":[5],"of":[6,17,59],"mixed-integer":[7,22,60,71],"linear":[8,23],"programming.":[9,62],"In":[10,63],"this":[11],"paper,":[12],"we":[13,65,83],"present":[14],"an":[15],"extension":[16],"the":[18,57,80],"duality":[19,87],"theory":[20],"for":[21,70],"(see":[25],"[M.":[26],"G\u00fczelsoy":[27],"and":[28,44,49],"T.":[29],"K.":[30],"Ralphs,":[31],"Int.":[32],"J.":[33],"Oper.":[34],"Res.":[35],"(Taichung),":[36],"4":[37],"(2007),":[38],"pp.":[39],"118--137],":[40],"[G.":[41],"L.":[42,45],"Nemhauser":[43],"A.":[46],"Wolsey,":[47],"Integer":[48],"Combinatorial":[50],"Optimization,":[51],"Wiley-Interscience,":[52],"New":[53],"York,":[54],"1988])":[55],"to":[56],"case":[58],"particular,":[64],"construct":[66],"subadditive":[68],"dual":[69],"problems.":[74],"Under":[75],"simple":[77],"condition":[78],"on":[79],"primal":[81],"problem,":[82],"show":[84],"that":[85],"strong":[86],"holds.":[88]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}