{"id":"https://openalex.org/W1981020230","doi":"https://doi.org/10.1007/bf01585996","title":"An efficient cost scaling algorithm for the assignment problem","display_name":"An efficient cost scaling algorithm for the assignment problem","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W1981020230","doi":"https://doi.org/10.1007/bf01585996","mag":"1981020230"},"language":"en","primary_location":{"id":"doi:10.1007/bf01585996","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01585996","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/A5111783338","display_name":"Andrew V. Goldberg","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":["Computer Science Department, Stanford University, 94305-2140, Stanford, CA, United States","Computer Science Department, Stanford University, Stanford, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Stanford University, 94305-2140, Stanford, CA, United States","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Computer Science Department, Stanford University, Stanford, United States","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030258636","display_name":"Robert E. Kennedy","orcid":"https://orcid.org/0000-0002-5507-474X"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Kennedy","raw_affiliation_strings":["Computer Science Department, Stanford University, 94305-2140, Stanford, CA, United States","Computer Science Department, Stanford University, Stanford, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Stanford University, 94305-2140, Stanford, CA, United States","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Computer Science Department, Stanford University, Stanford, United States","institution_ids":["https://openalex.org/I97018004"]}]}],"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.1364,"has_fulltext":false,"cited_by_count":150,"citation_normalized_percentile":{"value":0.85818461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"71","issue":"2","first_page":"153","last_page":"177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","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/implementation","display_name":"Implementation","score":0.6703153848648071},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.6555836796760559},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6379427909851074},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.5853467583656311},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.544729471206665},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.5420459508895874},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4679642617702484},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4290653467178345},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.26367050409317017}],"concepts":[{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6703153848648071},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.6555836796760559},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6379427909851074},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5853467583656311},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.544729471206665},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.5420459508895874},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4679642617702484},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4290653467178345},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.26367050409317017},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bf01585996","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01585996","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:CiteSeerX.psu:10.1.1.228.3430","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.3430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/%7Epettie/matching/Goldberg-Kennedy-cost-scaling-alg-assignment.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.2942","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.2942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://theory.stanford.edu/pub/goldberg/stan-cs-93-1481.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W135641456","https://openalex.org/W177356506","https://openalex.org/W1493391054","https://openalex.org/W1537221987","https://openalex.org/W1963951527","https://openalex.org/W1969357318","https://openalex.org/W1973907457","https://openalex.org/W2009070933","https://openalex.org/W2044973895","https://openalex.org/W2045144252","https://openalex.org/W2050982038","https://openalex.org/W2056991815","https://openalex.org/W2061872629","https://openalex.org/W2064306958","https://openalex.org/W2090359754","https://openalex.org/W2125690626","https://openalex.org/W2139688603","https://openalex.org/W2203446654","https://openalex.org/W2222512263","https://openalex.org/W2403505203","https://openalex.org/W2406288514","https://openalex.org/W2407734796","https://openalex.org/W2608238601","https://openalex.org/W2609152907","https://openalex.org/W4300533730","https://openalex.org/W6644048355","https://openalex.org/W7030592919"],"related_works":["https://openalex.org/W2120447654","https://openalex.org/W2977179488","https://openalex.org/W2144453115","https://openalex.org/W1654189297","https://openalex.org/W2922558146","https://openalex.org/W2045438354","https://openalex.org/W2896686392","https://openalex.org/W2570329970","https://openalex.org/W327730424","https://openalex.org/W1981020230"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":8}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}