{"id":"https://openalex.org/W7100713279","doi":null,"title":"Explicit-constraint branching for solving mixed-integer programs","display_name":"Explicit-constraint branching for solving mixed-integer programs","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7100713279"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.117.1698","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.1698","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nps.navy.mil/orfacpag/resumepages/wood-pubs/appelgetwood.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7100713279"],"child_works_count":0,"type":"article","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":null,"display_name":"R. Kevin Wood","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"R. Kevin Wood","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9883000254631042,"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.9883000254631042,"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.004800000227987766,"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.0008999999845400453,"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/mixed-integer-programming","display_name":"mixed integer programming","score":0.8960000276565552},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.972000002861023}],"concepts":[{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.83160001039505},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.7379999756813049},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6574000120162964},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5759000182151794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5192000269889832},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4528999924659729},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.4392000138759613},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4122999906539917},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.39959999918937683},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.362199991941452},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3246000111103058},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3156999945640564},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.305400013923645},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.3043999969959259},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2791000008583069},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.26589998602867126}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.117.1698","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.1698","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nps.navy.mil/orfacpag/resumepages/wood-pubs/appelgetwood.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1512674478","https://openalex.org/W2331165527","https://openalex.org/W2070788858","https://openalex.org/W2990037646","https://openalex.org/W7100513328","https://openalex.org/W7096120147","https://openalex.org/W3081646536","https://openalex.org/W2277443561","https://openalex.org/W2068537726"],"abstract_inverted_index":{"Key":[0],"words:":[1],"integer":[2,46,55],"programming,":[3],"branch":[4,80],"and":[5,44,81],"bound":[6],"Abstract:":[7],"This":[8],"paper":[9],"develops":[10],"a":[11,36],"new":[12],"generalized-branching":[13],"technique":[14],"called":[15],"\u201cexplicitconstraint":[16],"branching":[17,50],"\u201d":[18],"(ECB)":[19],"to":[20,35,48],"improve":[21],"the":[22,39],"performance":[23],"of":[24,41,53,68],"branch-andbound":[25],"algorithms":[26],"for":[27],"solving":[28],"mixed-integer":[29],"programs":[30],"(MIPs).":[31],"ECB":[32,73],"adds":[33],"structure":[34],"MIP,":[37],"in":[38],"form":[40],"auxiliary":[42,45],"constraints":[43],"variables,":[47],"allow":[49],"on":[51,65],"groups":[52],"(original)":[54],"variables":[56],"that":[57,72],"would":[58],"not":[59],"otherwise":[60],"be":[61],"possible.":[62],"Computational":[63],"tests":[64],"three":[66],"sets":[67],"realworld":[69],"MIPs":[70],"demonstrate":[71],"often":[74],"improves":[75],"solution":[76],"times":[77],"over":[78],"standard":[79],"bound,":[82],"sometimes":[83],"dramatically.":[84],"1.":[85]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7100713279","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2025-10-27T00:00:00"}
