{"id":"https://openalex.org/W4306362517","doi":"https://doi.org/10.3390/a15100377","title":"The Assignment Problem and Its Relation to Logistics Problems","display_name":"The Assignment Problem and Its Relation to Logistics Problems","publication_year":2022,"publication_date":"2022-10-16","ids":{"openalex":"https://openalex.org/W4306362517","doi":"https://doi.org/10.3390/a15100377"},"language":"en","primary_location":{"id":"doi:10.3390/a15100377","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15100377","pdf_url":"https://www.mdpi.com/1999-4893/15/10/377/pdf?version=1666585543","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/10/377/pdf?version=1666585543","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013526104","display_name":"Milo\u0161 \u0160eda","orcid":"https://orcid.org/0000-0002-5378-9303"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Milos Seda","raw_affiliation_strings":["Institute of Automation and Computer Science, Faculty of Mechanical Engineering, Brno University of Technology, Technicka 2896/2, 623 00 Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Institute of Automation and Computer Science, Faculty of Mechanical Engineering, Brno University of Technology, Technicka 2896/2, 623 00 Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013526104"],"corresponding_institution_ids":["https://openalex.org/I60587646"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.9336,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78651404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"15","issue":"10","first_page":"377","last_page":"377"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6961562633514404},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6949014663696289},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6907532215118408},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6157994866371155},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.529909610748291},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.4769905209541321},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.47578632831573486},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.44928762316703796},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3405918478965759},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32554274797439575},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23266920447349548}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6961562633514404},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6949014663696289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6907532215118408},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6157994866371155},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.529909610748291},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.4769905209541321},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.47578632831573486},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.44928762316703796},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3405918478965759},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32554274797439575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23266920447349548},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a15100377","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15100377","pdf_url":"https://www.mdpi.com/1999-4893/15/10/377/pdf?version=1666585543","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:dspace.vutbr.cz:11012/208586","is_oa":true,"landing_page_url":"http://hdl.handle.net/11012/208586","pdf_url":null,"source":{"id":"https://openalex.org/S4306400317","display_name":"Brno University of Technology Digital Library (Brno University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I60587646","host_organization_name":"Brno University of Technology","host_organization_lineage":["https://openalex.org/I60587646"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms. 2022, vol. 15, issue 10, p. 1-27.","raw_type":"article"},{"id":"pmh:oai:doaj.org/article:b5baf1ced6a84abe9704e07cefe4a49c","is_oa":true,"landing_page_url":"https://doaj.org/article/b5baf1ced6a84abe9704e07cefe4a49c","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 10, p 377 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/10/377/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15100377","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15100377","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15100377","pdf_url":"https://www.mdpi.com/1999-4893/15/10/377/pdf?version=1666585543","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4306362517.pdf","grobid_xml":"https://content.openalex.org/works/W4306362517.grobid-xml"},"referenced_works_count":82,"referenced_works":["https://openalex.org/W1208385249","https://openalex.org/W1508459157","https://openalex.org/W1571087346","https://openalex.org/W1601649239","https://openalex.org/W1967005434","https://openalex.org/W1970025200","https://openalex.org/W1985734068","https://openalex.org/W2025982778","https://openalex.org/W2049967755","https://openalex.org/W2124221042","https://openalex.org/W2151554678","https://openalex.org/W2171103562","https://openalex.org/W2222512263","https://openalex.org/W2486715098","https://openalex.org/W2887386074","https://openalex.org/W2910516706","https://openalex.org/W2910903121","https://openalex.org/W2924260156","https://openalex.org/W2930154544","https://openalex.org/W2942489752","https://openalex.org/W2946619050","https://openalex.org/W2966696224","https://openalex.org/W2982628822","https://openalex.org/W2986020234","https://openalex.org/W3006587535","https://openalex.org/W3016958336","https://openalex.org/W3084306722","https://openalex.org/W3091250687","https://openalex.org/W3092670634","https://openalex.org/W3098074841","https://openalex.org/W3098727560","https://openalex.org/W3120613588","https://openalex.org/W3139531072","https://openalex.org/W3161970260","https://openalex.org/W3162839318","https://openalex.org/W3164334189","https://openalex.org/W3166116884","https://openalex.org/W3169868693","https://openalex.org/W3176361500","https://openalex.org/W3184574068","https://openalex.org/W3187543867","https://openalex.org/W3190572613","https://openalex.org/W3192010230","https://openalex.org/W3193968068","https://openalex.org/W3196402541","https://openalex.org/W3198215788","https://openalex.org/W3207336199","https://openalex.org/W3211489951","https://openalex.org/W3212166736","https://openalex.org/W3215850519","https://openalex.org/W3217642487","https://openalex.org/W4200145953","https://openalex.org/W4206324560","https://openalex.org/W4206782948","https://openalex.org/W4207008679","https://openalex.org/W4210462762","https://openalex.org/W4210637156","https://openalex.org/W4211036892","https://openalex.org/W4211232163","https://openalex.org/W4214597316","https://openalex.org/W4214849974","https://openalex.org/W4220942767","https://openalex.org/W4220960034","https://openalex.org/W4221035225","https://openalex.org/W4221100173","https://openalex.org/W4224222848","https://openalex.org/W4224304368","https://openalex.org/W4224909966","https://openalex.org/W4239749705","https://openalex.org/W4248814197","https://openalex.org/W4251391716","https://openalex.org/W4280521253","https://openalex.org/W4281255500","https://openalex.org/W4281720841","https://openalex.org/W4283458668","https://openalex.org/W4283772399","https://openalex.org/W4283775720","https://openalex.org/W4284881381","https://openalex.org/W4285403416","https://openalex.org/W4286567657","https://openalex.org/W4294946178","https://openalex.org/W6815767843"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W2054495636","https://openalex.org/W4306878646","https://openalex.org/W2164188042","https://openalex.org/W2031913815"],"abstract_inverted_index":{"The":[0,148],"assignment":[1],"problem":[2,5,177,188],"is":[3,43,102,144,159],"a":[4],"that":[6],"takes":[7],"many":[8],"forms":[9],"in":[10,97,111,128,142,146],"optimization":[11],"and":[12,15,26,37,114,184],"graph":[13],"theory,":[14],"by":[16],"changing":[17],"some":[18,52],"of":[19,45,48,53,64,71,79,92,105,124,131,138,171,195],"the":[20,46,54,61,72,77,89,98,112,125,129,135,166,172,179,185,193,196],"constraints":[21],"or":[22,81,121],"interpreting":[23],"them":[24],"differently":[25],"adding":[27],"other":[28],"constraints,":[29],"it":[30],"can":[31],"be":[32,153],"converted":[33],"to":[34,191],"routing,":[35],"distribution,":[36],"scheduling":[38,176],"problems.":[39],"Showing":[40],"such":[41],"correlations":[42],"one":[44],"aims":[47],"this":[49,157],"paper.":[50],"For":[51],"derived":[55,181],"problems":[56],"having":[57],"exponential":[58],"time":[59],"complexity,":[60],"question":[62],"arises":[63],"their":[65],"solvability":[66],"for":[67],"larger":[68,109],"instances.":[69],"Instead":[70],"traditional":[73],"approach":[74],"based":[75],"on":[76,88],"use":[78,91],"approximate":[80],"stochastic":[82,132],"heuristic":[83],"methods,":[84],"we":[85],"focus":[86],"here":[87],"direct":[90],"mixed":[93],"integer":[94],"programming":[95],"models":[96],"GAMS":[99],"environment,":[100],"which":[101],"now":[103],"capable":[104],"solving":[106],"instances":[107],"much":[108],"than":[110],"past":[113],"does":[115],"not":[116,160],"require":[117],"complex":[118],"parameter":[119],"settings":[120],"statistical":[122],"evaluation":[123],"results":[126],"as":[127,162,165],"case":[130],"heuristics":[133],"because":[134,156],"computational":[136],"core":[137],"software":[139],"tools,":[140],"nested":[141],"GAMS,":[143],"deterministic":[145],"nature.":[147],"source":[149],"codes":[150],"presented":[151],"may":[152],"an":[154],"aid":[155],"tool":[158],"yet":[161],"well":[163],"known":[164],"MATLAB":[167],"Optimisation":[168],"Toolbox.":[169],"Benchmarks":[170],"permutation":[173],"flow":[174],"shop":[175],"with":[178],"informally":[180],"MIP":[182],"model":[183],"traveling":[186],"salesman":[187],"are":[189],"used":[190],"present":[192],"limits":[194],"software\u2019s":[197],"applicability.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}