{"id":"https://openalex.org/W2062956534","doi":"https://doi.org/10.1007/bf01593766","title":"Using shortest paths in some transshipment problems with concave costs","display_name":"Using shortest paths in some transshipment problems with concave costs","publication_year":1977,"publication_date":"1977-12-01","ids":{"openalex":"https://openalex.org/W2062956534","doi":"https://doi.org/10.1007/bf01593766","mag":"2062956534"},"language":"en","primary_location":{"id":"doi:10.1007/bf01593766","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01593766","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/A5040709965","display_name":"Gery Daeninck","orcid":null},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Gery Daeninck","raw_affiliation_strings":["Universit\u00e9 Catholique de Louvain, Heverlee, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Catholique de Louvain, Heverlee, Belgium","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048169843","display_name":"Yves Smeers","orcid":"https://orcid.org/0000-0003-4312-6175"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Yves Smeers","raw_affiliation_strings":["Universit\u00e9 Catholique de Louvain, Heverlee, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Catholique de Louvain, Heverlee, Belgium","institution_ids":["https://openalex.org/I95674353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.0254,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86885851,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"1","first_page":"18","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9894000291824341,"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.9894000291824341,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9732000231742859,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9710999727249146,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/transshipment","display_name":"Transshipment (information security)","score":0.8459010124206543},{"id":"https://openalex.org/keywords/extreme-point","display_name":"Extreme point","score":0.7067558169364929},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6961096525192261},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.6528701782226562},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6501109004020691},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6394566297531128},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4314672350883484},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23758578300476074},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19966834783554077},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1710939109325409},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.12905853986740112}],"concepts":[{"id":"https://openalex.org/C2776234997","wikidata":"https://www.wikidata.org/wiki/Q17134191","display_name":"Transshipment (information security)","level":2,"score":0.8459010124206543},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.7067558169364929},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6961096525192261},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.6528701782226562},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6501109004020691},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6394566297531128},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4314672350883484},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23758578300476074},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19966834783554077},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1710939109325409},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.12905853986740112},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01593766","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01593766","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"},{"id":"pmh:oai:RePEc:cor:louvrp:-307","is_oa":false,"landing_page_url":"http://doi.org/10.1007/BF01593766","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"preprint"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1594308867","https://openalex.org/W1970135106","https://openalex.org/W1984407615","https://openalex.org/W1988628121","https://openalex.org/W2049536263","https://openalex.org/W2059796704","https://openalex.org/W2064973050","https://openalex.org/W2099408765","https://openalex.org/W2127470768","https://openalex.org/W2169528473","https://openalex.org/W2325174870","https://openalex.org/W4301216918"],"related_works":["https://openalex.org/W2989662842","https://openalex.org/W3164383682","https://openalex.org/W2081792944","https://openalex.org/W2063230249","https://openalex.org/W2138955107","https://openalex.org/W1977436202","https://openalex.org/W1971899740","https://openalex.org/W3184709015","https://openalex.org/W1979628151","https://openalex.org/W3122709119"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-16T07:32:37.131356","created_date":"2025-10-10T00:00:00"}