{"id":"https://openalex.org/W1483563708","doi":"https://doi.org/10.1007/3-540-45578-7_2","title":"Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming","display_name":"Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1483563708","doi":"https://doi.org/10.1007/3-540-45578-7_2","mag":"1483563708"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45578-7_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45578-7_2","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5065212961","display_name":"Erlendur S. Thorsteinsson","orcid":null},"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":"Erlendur S. Thorsteinsson","raw_affiliation_strings":["Graduate School of Industrial Administration, Carnegie Mellon University, Schenley Park, 15213-3890, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Industrial Administration, Carnegie Mellon University, Schenley Park, 15213-3890, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065212961"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.8957,"has_fulltext":false,"cited_by_count":152,"citation_normalized_percentile":{"value":0.93478261,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"16","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"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.9991000294685364,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.995199978351593,"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.7047871351242065},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6944101452827454},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6845929622650146},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6818568706512451},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.6568835377693176},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6299306750297546},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.5416415929794312},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5151211619377136},{"id":"https://openalex.org/keywords/benders-decomposition","display_name":"Benders' decomposition","score":0.4814140796661377},{"id":"https://openalex.org/keywords/concurrent-constraint-logic-programming","display_name":"Concurrent constraint logic programming","score":0.4714962840080261},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.4623137414455414},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4445400536060333},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44437167048454285},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.41761288046836853},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3897554278373718},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38965314626693726},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.24249178171157837},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24052485823631287},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.12271854281425476}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7047871351242065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6944101452827454},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6845929622650146},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6818568706512451},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.6568835377693176},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6299306750297546},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.5416415929794312},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5151211619377136},{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.4814140796661377},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.4714962840080261},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4623137414455414},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4445400536060333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44437167048454285},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.41761288046836853},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3897554278373718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38965314626693726},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.24249178171157837},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24052485823631287},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.12271854281425476}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-45578-7_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45578-7_2","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.8892","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.8892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.andrew.cmu.edu/~esth/papers/cp-2001_052001.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W90532612","https://openalex.org/W1508945008","https://openalex.org/W1523022060","https://openalex.org/W1547347370","https://openalex.org/W1553032077","https://openalex.org/W1563600186","https://openalex.org/W1580354722","https://openalex.org/W1607908797","https://openalex.org/W1751048338","https://openalex.org/W2004053479","https://openalex.org/W2006289634","https://openalex.org/W2016363250","https://openalex.org/W2044121814","https://openalex.org/W2061962896","https://openalex.org/W2097731353","https://openalex.org/W2104857676","https://openalex.org/W2117182850","https://openalex.org/W2126386151","https://openalex.org/W2134094348","https://openalex.org/W2135591081","https://openalex.org/W2139337114","https://openalex.org/W2152512857","https://openalex.org/W4230045511"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W2769220156","https://openalex.org/W4252122881","https://openalex.org/W4302819359","https://openalex.org/W4210880521","https://openalex.org/W134055995","https://openalex.org/W2024753861","https://openalex.org/W4300803591","https://openalex.org/W2769538987","https://openalex.org/W2351457120"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2025-10-10T00:00:00"}