{"id":"https://openalex.org/W1976896050","doi":"https://doi.org/10.1007/bf01580237","title":"Improved penalty calculations for a mixed integer branch-and-bound algorithm","display_name":"Improved penalty calculations for a mixed integer branch-and-bound algorithm","publication_year":1974,"publication_date":"1974-12-01","ids":{"openalex":"https://openalex.org/W1976896050","doi":"https://doi.org/10.1007/bf01580237","mag":"1976896050"},"language":"en","primary_location":{"id":"doi:10.1007/bf01580237","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01580237","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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","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/A5076048717","display_name":"Ronald D. Armstrong","orcid":"https://orcid.org/0000-0001-6991-4730"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ronald D. Armstrong","raw_affiliation_strings":["University of Massachusetts, Amherst, Mass., USA","University of Massachusetts-Amherst, USA,"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts, Amherst, Mass., USA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"University of Massachusetts-Amherst, USA,","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020391994","display_name":"Prabhakant Sinha","orcid":null},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prabhakant Sinha","raw_affiliation_strings":["University of Massachusetts, Amherst, Mass., USA","University of Massachusetts-Amherst, USA,"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts, Amherst, Mass., USA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"University of Massachusetts-Amherst, USA,","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076048717"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":12.508,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.98194131,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"1","first_page":"212","last_page":"223"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9991000294685364,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9991000294685364,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"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/mathematics","display_name":"Mathematics","score":0.8053914904594421},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.7481094002723694},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7317732572555542},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.7244539260864258},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.6877841949462891},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6847397685050964},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5128241181373596},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.5086570382118225},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4993464946746826},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.4887430667877197},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4766327142715454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4295833706855774},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41719311475753784},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3732576370239258},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3499055504798889},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13402533531188965}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8053914904594421},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.7481094002723694},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7317732572555542},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.7244539260864258},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.6877841949462891},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6847397685050964},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5128241181373596},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.5086570382118225},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4993464946746826},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4887430667877197},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4766327142715454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4295833706855774},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41719311475753784},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3732576370239258},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3499055504798889},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13402533531188965},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01580237","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01580237","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W126198200","https://openalex.org/W1530075571","https://openalex.org/W1999049191","https://openalex.org/W2005305324","https://openalex.org/W2044121814","https://openalex.org/W2045411541","https://openalex.org/W2046215222","https://openalex.org/W2103254960","https://openalex.org/W2134668949","https://openalex.org/W2144931885","https://openalex.org/W2169666402","https://openalex.org/W4253922247","https://openalex.org/W6675435752"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W2084616826","https://openalex.org/W1971357083","https://openalex.org/W1968202374","https://openalex.org/W2734758384","https://openalex.org/W1595394363","https://openalex.org/W2354460058","https://openalex.org/W125276123","https://openalex.org/W2275468419","https://openalex.org/W3153884794"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}