{"id":"https://openalex.org/W2072866475","doi":"https://doi.org/10.1016/s0305-0548(99)00095-7","title":"An algorithm for the biobjective integer minimum cost flow problem","display_name":"An algorithm for the biobjective integer minimum cost flow problem","publication_year":2001,"publication_date":"2001-02-01","ids":{"openalex":"https://openalex.org/W2072866475","doi":"https://doi.org/10.1016/s0305-0548(99)00095-7","mag":"2072866475"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(99)00095-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(99)00095-7","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","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/A5086529667","display_name":"Antonio Sede\u00f1o\u2010Noda","orcid":"https://orcid.org/0000-0003-0681-4585"},"institutions":[{"id":"https://openalex.org/I158438070","display_name":"Universidad de La Laguna","ror":"https://ror.org/01r9z8p25","country_code":"ES","type":"education","lineage":["https://openalex.org/I158438070"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"A. Sede\u00f1o-Noda","raw_affiliation_strings":["Departamento de Estad\u0131\u0301stica, Investigaci\u00f3n Operativa y Computaci\u00f3n (DEIOC), Universidad de La Laguna, 38271-La Laguna, Tenerife (Espa\u00f1a), Spain"],"affiliations":[{"raw_affiliation_string":"Departamento de Estad\u0131\u0301stica, Investigaci\u00f3n Operativa y Computaci\u00f3n (DEIOC), Universidad de La Laguna, 38271-La Laguna, Tenerife (Espa\u00f1a), Spain","institution_ids":["https://openalex.org/I158438070"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008085496","display_name":"C. Gonz\u00e1lez-Mart\u0131\u0301n","orcid":null},"institutions":[{"id":"https://openalex.org/I158438070","display_name":"Universidad de La Laguna","ror":"https://ror.org/01r9z8p25","country_code":"ES","type":"education","lineage":["https://openalex.org/I158438070"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"C. Gonz\u00e1lez-Mart\u0131\u0301n","raw_affiliation_strings":["Departamento de Estad\u0131\u0301stica, Investigaci\u00f3n Operativa y Computaci\u00f3n (DEIOC), Universidad de La Laguna, 38271-La Laguna, Tenerife (Espa\u00f1a), Spain"],"affiliations":[{"raw_affiliation_string":"Departamento de Estad\u0131\u0301stica, Investigaci\u00f3n Operativa y Computaci\u00f3n (DEIOC), Universidad de La Laguna, 38271-La Laguna, Tenerife (Espa\u00f1a), Spain","institution_ids":["https://openalex.org/I158438070"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008085496"],"corresponding_institution_ids":["https://openalex.org/I158438070"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":4.7305,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.9385092,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"28","issue":"2","first_page":"139","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9564999938011169,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9564999938011169,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7283245325088501},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.6906012296676636},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6623704433441162},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.6436929106712341},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6135701537132263},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5446587800979614},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5172548890113831},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5156346559524536},{"id":"https://openalex.org/keywords/extreme-point","display_name":"Extreme point","score":0.4787123203277588},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.4673217833042145},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.45139026641845703},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4433843493461609},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4211602807044983},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4132170081138611},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37353700399398804},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3541032373905182}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7283245325088501},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6906012296676636},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6623704433441162},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.6436929106712341},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6135701537132263},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5446587800979614},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5172548890113831},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5156346559524536},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.4787123203277588},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.4673217833042145},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.45139026641845703},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4433843493461609},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4211602807044983},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4132170081138611},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37353700399398804},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3541032373905182},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0305-0548(99)00095-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(99)00095-7","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1576123648","https://openalex.org/W1978090048","https://openalex.org/W1989559293","https://openalex.org/W2012739502","https://openalex.org/W2033982221","https://openalex.org/W2056178482","https://openalex.org/W2062147306","https://openalex.org/W2065305730","https://openalex.org/W2081975444","https://openalex.org/W2082300779","https://openalex.org/W2094079836","https://openalex.org/W2338905098","https://openalex.org/W2464942633","https://openalex.org/W4285719527","https://openalex.org/W6634435243","https://openalex.org/W6703734804","https://openalex.org/W6719297660"],"related_works":["https://openalex.org/W3141113327","https://openalex.org/W4206915070","https://openalex.org/W3000598246","https://openalex.org/W4381333972","https://openalex.org/W3159013657","https://openalex.org/W184565551","https://openalex.org/W2590727506","https://openalex.org/W4311255633","https://openalex.org/W2069541586","https://openalex.org/W4235062313"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}