{"id":"https://openalex.org/W2914907619","doi":"https://doi.org/10.1007/bf01096771","title":"An improved branch and bound algorithm for minimum concave cost network flow problems","display_name":"An improved branch and bound algorithm for minimum concave cost network flow problems","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2914907619","doi":"https://doi.org/10.1007/bf01096771","mag":"2914907619"},"language":"en","primary_location":{"id":"doi:10.1007/bf01096771","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01096771","pdf_url":null,"source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"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":"Journal of Global Optimization","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/A5044327905","display_name":"Bruce W. Lamar","orcid":null},"institutions":[{"id":"https://openalex.org/I185492890","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39","country_code":"NZ","type":"education","lineage":["https://openalex.org/I185492890"]}],"countries":["NZ"],"is_corresponding":true,"raw_author_name":"Bruce W. Lamar","raw_affiliation_strings":["Department of Management, University of Canterbury, Christchurch, New Zealand"],"affiliations":[{"raw_affiliation_string":"Department of Management, University of Canterbury, Christchurch, New Zealand","institution_ids":["https://openalex.org/I185492890"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044327905"],"corresponding_institution_ids":["https://openalex.org/I185492890"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2780},"apc_paid":null,"fwci":4.3983,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.94633245,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"3","issue":"3","first_page":"261","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9873999953269958,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.972599983215332,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7516161203384399},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.704170823097229},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.6116048693656921},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5879008173942566},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5470860004425049},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5291348695755005},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5188135504722595},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4900282621383667},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4858967661857605},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.47775450348854065},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.46464937925338745},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4581971764564514},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4268357455730438},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21973749995231628},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09166383743286133}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7516161203384399},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.704170823097229},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6116048693656921},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5879008173942566},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5470860004425049},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5291348695755005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5188135504722595},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4900282621383667},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4858967661857605},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.47775450348854065},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.46464937925338745},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4581971764564514},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4268357455730438},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21973749995231628},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09166383743286133},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"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/bf01096771","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01096771","pdf_url":null,"source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"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":"Journal of Global Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6700000166893005,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W572039779","https://openalex.org/W1545925697","https://openalex.org/W1963764014","https://openalex.org/W1964119857","https://openalex.org/W1967088945","https://openalex.org/W1968119063","https://openalex.org/W1971809832","https://openalex.org/W1976440380","https://openalex.org/W1992765037","https://openalex.org/W1996431511","https://openalex.org/W2011039300","https://openalex.org/W2029146853","https://openalex.org/W2030189831","https://openalex.org/W2030241623","https://openalex.org/W2038002740","https://openalex.org/W2048437057","https://openalex.org/W2069737189","https://openalex.org/W2076840393","https://openalex.org/W2084071321","https://openalex.org/W2094169823","https://openalex.org/W2095392072","https://openalex.org/W2096586036","https://openalex.org/W2121501602","https://openalex.org/W2123241324","https://openalex.org/W2139805900","https://openalex.org/W2143291407","https://openalex.org/W2150855695","https://openalex.org/W2151525839","https://openalex.org/W2157924277","https://openalex.org/W2158503982","https://openalex.org/W2160408584","https://openalex.org/W2234087396","https://openalex.org/W2256028184","https://openalex.org/W2481105332","https://openalex.org/W2516321972","https://openalex.org/W4253845860","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W3035974271","https://openalex.org/W3161514703","https://openalex.org/W3207627914","https://openalex.org/W2270959725","https://openalex.org/W2151525839","https://openalex.org/W1983294952","https://openalex.org/W648253840","https://openalex.org/W2941986668"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}