{"id":"https://openalex.org/W2078928589","doi":"https://doi.org/10.1002/net.3230170303","title":"On some matching problems arising in vehicle scheduling models","display_name":"On some matching problems arising in vehicle scheduling models","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W2078928589","doi":"https://doi.org/10.1002/net.3230170303","mag":"2078928589"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230170303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170303","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/A5059080368","display_name":"Alan A. Bertossi","orcid":null},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"A. A. Bertossi","raw_affiliation_strings":["Dipartimento di Informatica, Universita\u0300 di Pisa, 56100 Pisa, Italy","Dipartimento di Informatic\u00e0, Universit\u00e0 di Pisa, 56100 Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universita\u0300 di Pisa, 56100 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Dipartimento di Informatic\u00e0, Universit\u00e0 di Pisa, 56100 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085290805","display_name":"Paolo Carraresi","orcid":null},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P. Carraresi","raw_affiliation_strings":["Dipartimento di Informatica, Universita\u0300 di Pisa, 56100 Pisa, Italy","Dipartimento di Informatic\u00e0, Universit\u00e0 di Pisa, 56100 Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universita\u0300 di Pisa, 56100 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Dipartimento di Informatic\u00e0, Universit\u00e0 di Pisa, 56100 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090391520","display_name":"Giorgio Gallo","orcid":"https://orcid.org/0000-0003-4818-7508"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G. Gallo","raw_affiliation_strings":["Dipartimento di Informatica, Universita\u0300 di Pisa, 56100 Pisa, Italy","Dipartimento di Informatic\u00e0, Universit\u00e0 di Pisa, 56100 Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universita\u0300 di Pisa, 56100 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Dipartimento di Informatic\u00e0, Universit\u00e0 di Pisa, 56100 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5059080368"],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.3433,"has_fulltext":false,"cited_by_count":237,"citation_normalized_percentile":{"value":0.88842631,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"17","issue":"3","first_page":"271","last_page":"281"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T12546","display_name":"Smart Parking Systems Research","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/bipartite-graph","display_name":"Bipartite graph","score":0.8240848779678345},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6937378644943237},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.6639245748519897},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.656575083732605},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6271746158599854},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5412622690200806},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5386760830879211},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5361082553863525},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.380628764629364},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3499595522880554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32848885655403137},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12679779529571533}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8240848779678345},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6937378644943237},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.6639245748519897},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.656575083732605},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6271746158599854},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5412622690200806},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5386760830879211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5361082553863525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.380628764629364},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3499595522880554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32848885655403137},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12679779529571533},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230170303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170303","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W2000200530","https://openalex.org/W2000772237","https://openalex.org/W2011039300","https://openalex.org/W2063961786","https://openalex.org/W2079828065","https://openalex.org/W2146870367"],"related_works":["https://openalex.org/W4205756423","https://openalex.org/W2567825307","https://openalex.org/W2054458431","https://openalex.org/W2371352078","https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2362975861","https://openalex.org/W2804963084","https://openalex.org/W2898827770","https://openalex.org/W2151412766"],"abstract_inverted_index":{"Abstract":[0],"Two":[1],"bipartite":[2],"matching":[3,13,64],"problems":[4],"arising":[5],"in":[6],"Vehicle":[7],"Scheduling":[8],"are":[9],"considered:":[10],"the":[11,15,19,34,58,62],"capacitated":[12,59],"and":[14],"multicommodity":[16,63],"matching.":[17],"For":[18],"former,":[20],"given":[21],"a":[22,29],"reasonable":[23],"cost":[24],"structure,":[25],"we":[26],"can":[27],"exhibit":[28],"polynomial":[30],"time":[31],"algorithm,":[32],"while":[33],"general":[35],"case":[36],"is":[37,45,65],"conjectured":[38],"to":[39,47],"be":[40,48],"NP\u2010hard.":[41,49],"The":[42],"latter":[43],"problem":[44],"shown":[46],"A":[50],"heuristic":[51],"algorithm":[52],"based":[53],"on":[54],"Lagrangean":[55],"relaxation":[56],"for":[57],"version":[60],"of":[61],"also":[66],"presented":[67],"together":[68],"with":[69],"experimental":[70],"results.":[71]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-03T08:47:05.690250","created_date":"2025-10-10T00:00:00"}