{"id":"https://openalex.org/W3096869031","doi":"https://doi.org/10.1007/s12532-020-00191-6","title":"Incorporating bounds from decision diagrams into integer programming","display_name":"Incorporating bounds from decision diagrams into integer programming","publication_year":2020,"publication_date":"2020-11-02","ids":{"openalex":"https://openalex.org/W3096869031","doi":"https://doi.org/10.1007/s12532-020-00191-6","mag":"3096869031"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-020-00191-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-020-00191-6","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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 Computation","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/A5021227744","display_name":"Christian Tjandraatmadja","orcid":"https://orcid.org/0000-0002-0881-3511"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Christian Tjandraatmadja","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049170163","display_name":"Willem\u2010Jan van Hoeve","orcid":"https://orcid.org/0000-0002-0023-753X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Willem-Jan van Hoeve","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021227744"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090},"apc_paid":null,"fwci":1.2949,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.82442748,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"13","issue":"2","first_page":"225","last_page":"256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9972000122070312,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9972000122070312,"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/T10142","display_name":"Formal Methods in Verification","score":0.9939000010490417,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9531000256538391,"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/integer-programming","display_name":"Integer programming","score":0.6903866529464722},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6502714157104492},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.644194483757019},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5852118134498596},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.530195415019989},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5084437727928162},{"id":"https://openalex.org/keywords/influence-diagram","display_name":"Influence diagram","score":0.4529981017112732},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4483906626701355},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.44576066732406616},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.44325560331344604},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.43753692507743835},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4335612654685974},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4102601110935211},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.331462025642395},{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.2593923509120941},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23062503337860107},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14559757709503174},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.11461013555526733},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11298123002052307}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6903866529464722},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6502714157104492},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.644194483757019},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5852118134498596},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.530195415019989},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5084437727928162},{"id":"https://openalex.org/C20837028","wikidata":"https://www.wikidata.org/wiki/Q623966","display_name":"Influence diagram","level":3,"score":0.4529981017112732},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4483906626701355},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.44576066732406616},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.44325560331344604},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.43753692507743835},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4335612654685974},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4102601110935211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.331462025642395},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.2593923509120941},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23062503337860107},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14559757709503174},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.11461013555526733},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11298123002052307},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s12532-020-00191-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-020-00191-6","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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 Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7599999904632568}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W143396352","https://openalex.org/W1429896230","https://openalex.org/W1483038746","https://openalex.org/W1488809080","https://openalex.org/W1501750204","https://openalex.org/W1563516866","https://openalex.org/W1583086045","https://openalex.org/W1599077886","https://openalex.org/W1700954517","https://openalex.org/W1766547439","https://openalex.org/W1990267895","https://openalex.org/W1994143452","https://openalex.org/W2001912652","https://openalex.org/W2031823362","https://openalex.org/W2041754841","https://openalex.org/W2042619750","https://openalex.org/W2080267935","https://openalex.org/W2098813345","https://openalex.org/W2099251677","https://openalex.org/W2099452584","https://openalex.org/W2106106289","https://openalex.org/W2110410218","https://openalex.org/W2112090702","https://openalex.org/W2117811434","https://openalex.org/W2118382442","https://openalex.org/W2169403817","https://openalex.org/W2187140470","https://openalex.org/W2222122796","https://openalex.org/W2416899520","https://openalex.org/W2551102339","https://openalex.org/W2587095554","https://openalex.org/W2768937018","https://openalex.org/W2887383021","https://openalex.org/W2927991459","https://openalex.org/W2939087242","https://openalex.org/W3006199842","https://openalex.org/W3123057019","https://openalex.org/W4240544076"],"related_works":["https://openalex.org/W2097415053","https://openalex.org/W1514298554","https://openalex.org/W1486916474","https://openalex.org/W4243324743","https://openalex.org/W1531664660","https://openalex.org/W2009796757","https://openalex.org/W2120647900","https://openalex.org/W1496100162","https://openalex.org/W4252122881","https://openalex.org/W4303044088"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}