{"id":"https://openalex.org/W2020030076","doi":"https://doi.org/10.1007/bf01580430","title":"A branch and bound algorithm for the generalized assignment problem","display_name":"A branch and bound algorithm for the generalized assignment problem","publication_year":1975,"publication_date":"1975-12-01","ids":{"openalex":"https://openalex.org/W2020030076","doi":"https://doi.org/10.1007/bf01580430","mag":"2020030076"},"language":"en","primary_location":{"id":"doi:10.1007/bf01580430","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01580430","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/A5007162329","display_name":"G. Terry Ross","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":true,"raw_author_name":"G. Terry Ross","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/A5042133167","display_name":"Richard M. Soland","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard M. Soland","raw_affiliation_strings":["University of Texas, Austin, Tex., USA","University of Texas, Austin, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Texas, Austin, Tex., USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas, Austin, USA#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007162329"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":48.4274,"has_fulltext":false,"cited_by_count":470,"citation_normalized_percentile":{"value":0.99875052,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"8","issue":"1","first_page":"91","last_page":"103"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8996107578277588},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.8687500357627869},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7279125452041626},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.705663800239563},{"id":"https://openalex.org/keywords/linear-bottleneck-assignment-problem","display_name":"Linear bottleneck assignment problem","score":0.6846407651901245},{"id":"https://openalex.org/keywords/weapon-target-assignment-problem","display_name":"Weapon target assignment problem","score":0.6702795624732971},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6686567068099976},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6581433415412903},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.6445926427841187},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.5767489671707153},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5538531541824341},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5189844965934753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5152519345283508},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49530187249183655},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4931432604789734},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.4665612280368805},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43259164690971375},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.40505683422088623},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3300803303718567}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8996107578277588},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.8687500357627869},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7279125452041626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.705663800239563},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.6846407651901245},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.6702795624732971},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6686567068099976},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6581433415412903},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.6445926427841187},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.5767489671707153},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5538531541824341},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5189844965934753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5152519345283508},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49530187249183655},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4931432604789734},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.4665612280368805},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43259164690971375},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.40505683422088623},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3300803303718567},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01580430","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01580430","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":[{"id":"https://openalex.org/F4320319362","display_name":"Naif Arab University for Security Sciences","ror":"https://ror.org/049c46160"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W267460908","https://openalex.org/W1530075571","https://openalex.org/W1979872043","https://openalex.org/W2015247562","https://openalex.org/W2018638861","https://openalex.org/W2033735555","https://openalex.org/W2058324360","https://openalex.org/W2066850897","https://openalex.org/W2096588035","https://openalex.org/W2104836429","https://openalex.org/W2125610768","https://openalex.org/W2139211712","https://openalex.org/W4242130683","https://openalex.org/W4250535541","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2113934189","https://openalex.org/W2937059810","https://openalex.org/W2031498611","https://openalex.org/W3149825000","https://openalex.org/W1586515950","https://openalex.org/W1560792291","https://openalex.org/W2760584304","https://openalex.org/W2020030076","https://openalex.org/W591981591","https://openalex.org/W1985289934"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":21},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":22},{"year":2019,"cited_by_count":32},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":5}],"updated_date":"2026-03-23T07:41:27.035349","created_date":"2025-10-10T00:00:00"}