{"id":"https://openalex.org/W2068162359","doi":"https://doi.org/10.1002/(sici)1097-0037(199710)30:3<171::aid-net3>3.0.co;2-i","title":"The assignment problem with external interactions","display_name":"The assignment problem with external interactions","publication_year":1997,"publication_date":"1997-10-01","ids":{"openalex":"https://openalex.org/W2068162359","doi":"https://doi.org/10.1002/(sici)1097-0037(199710)30:3<171::aid-net3>3.0.co;2-i","mag":"2068162359"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199710)30:3<171::aid-net3>3.0.co;2-i","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199710)30:3<171::aid-net3>3.0.co;2-i","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5024294070","display_name":"Russ J. Vander Wiel","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Russ J. Vander Wiel","raw_affiliation_strings":["Department of Mechanical and Industrial Engineering, University of Illinois, Urbana, Illinois 61801"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Industrial Engineering, University of Illinois, Urbana, Illinois 61801","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031811254","display_name":"Nikolaos V. Sahinidis","orcid":"https://orcid.org/0000-0003-2087-9131"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikolaos V. Sahinidis","raw_affiliation_strings":["Department of Mechanical and Industrial Engineering, University of Illinois, Urbana, Illinois 61801"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Industrial Engineering, University of Illinois, Urbana, Illinois 61801","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031811254"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.22954213,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"3","first_page":"171","last_page":"185"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9940999746322632,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9940999746322632,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9876999855041504,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9787999987602234,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.6897251605987549},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.6565911769866943},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.638619601726532},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6381729245185852},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.581795334815979},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5813766717910767},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.512178897857666},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4644475281238556},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.44395071268081665},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43557724356651306},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.4297086298465729},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41584280133247375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.356828510761261},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1453997790813446},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08691251277923584}],"concepts":[{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.6897251605987549},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.6565911769866943},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.638619601726532},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6381729245185852},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.581795334815979},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5813766717910767},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.512178897857666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4644475281238556},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.44395071268081665},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43557724356651306},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.4297086298465729},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41584280133247375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.356828510761261},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1453997790813446},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08691251277923584},{"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.1002/(sici)1097-0037(199710)30:3<171::aid-net3>3.0.co;2-i","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199710)30:3<171::aid-net3>3.0.co;2-i","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.49000000953674316,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2937059810","https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W3035974271","https://openalex.org/W1586515950","https://openalex.org/W3161514703","https://openalex.org/W2379349345","https://openalex.org/W2379499702","https://openalex.org/W1561045713","https://openalex.org/W327730424"],"abstract_inverted_index":{"The":[0,89,160],"classical":[1],"assignment":[2,16,42,51,73,143,158],"problem":[3,43,52,74,138,144],"matches":[4],"n":[5,8],"jobs":[6,26,34],"to":[7,66,94,184],"machines":[9],"in":[10],"a":[11,49,54,96,107,118,134,141],"way":[12],"that":[13,100,123,179],"minimizes":[14],"total":[15],"costs.":[17],"To":[18],"allow":[19],"for":[20,87],"the":[21,28,36,41,76,102,125,150],"possibility":[22],"of":[23,61,75,110,145],"diverting":[24],"internal":[25],"outside":[27],"machine":[29,37],"shop":[30],"and":[31,139,157],"accepting":[32],"external":[33,45],"into":[35],"shop,":[38],"we":[39,148],"define":[40],"with":[44,53,106,153],"interactions":[46],"(APEX)":[47],"as":[48,68,71,133,140],"linear":[50],"single":[55],"unrestricted":[56],"arc.":[57],"A":[58],"feasible":[59,98],"solution":[60,99],"APEX":[62,129],"may":[63],"involve":[64],"up":[65],"twice":[67],"many":[69],"assignments":[70],"an":[72],"same":[77],"size.":[78],"An":[79],"efficient":[80],"sequential":[81],"shortest":[82,119],"path":[83,121],"algorithm":[84,90,122,152,161],"is":[85,114,181],"developed":[86,162],"APEX.":[88],"uses":[91],"initialization":[92],"heuristics":[93],"obtain":[95],"dual":[97],"satisfies":[101],"complementary":[103],"slackness":[104],"conditions":[105],"partial":[108],"set":[109],"assignments.":[111,127],"Primal":[112],"feasibility":[113],"then":[115],"obtained":[116],"through":[117],"augmenting":[120],"makes":[124],"remaining":[126],"As":[128],"can":[130],"be":[131],"formulated":[132],"minimum-cost":[135],"network":[136,155],"flow":[137,156],"standard":[142],"larger":[146],"size,":[147],"compare":[149],"proposed":[151],"state-of-the-art":[154],"approaches.":[159,172],"here":[163],"has":[164],"much":[165],"smaller":[166],"storage":[167],"requirements":[168],"than":[169],"have":[170],"alternative":[171],"In":[173],"addition,":[174],"extensive":[175],"computational":[176],"results":[177],"demonstrate":[178],"it":[180],"from":[182],"2":[183],"52":[185],"times":[186],"faster.":[187],"\u00a9":[188],"1997":[189,197],"John":[190],"Wiley":[191],"&":[192],"Sons,":[193],"Inc.":[194],"Networks":[195],"30:171\u2013185,":[196]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}