{"id":"https://openalex.org/W2074271250","doi":"https://doi.org/10.1002/net.3230180305","title":"New lower bounds for the Capacitated Arc Routing Problem","display_name":"New lower bounds for the Capacitated Arc Routing Problem","publication_year":1988,"publication_date":"1988-09-01","ids":{"openalex":"https://openalex.org/W2074271250","doi":"https://doi.org/10.1002/net.3230180305","mag":"2074271250"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230180305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230180305","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/A5111750617","display_name":"Wen Lea Pearn","orcid":null},"institutions":[{"id":"https://openalex.org/I67328108","display_name":"California State University, Fresno","ror":"https://ror.org/03enmdz06","country_code":"US","type":"education","lineage":["https://openalex.org/I67328108"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Wen Lea Pearn","raw_affiliation_strings":["Department of Mathematics, California State University, Fresno, California 93740","Department of Industrial Engineering and Management"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, California State University, Fresno, California 93740","institution_ids":["https://openalex.org/I67328108"]},{"raw_affiliation_string":"Department of Industrial Engineering and Management","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111750617"],"corresponding_institution_ids":["https://openalex.org/I67328108"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.259,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.81396296,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"18","issue":"3","first_page":"181","last_page":"191"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.996399998664856,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9850999712944031,"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/arc-routing","display_name":"Arc routing","score":0.9682645201683044},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.817107081413269},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7047063708305359},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6205571889877319},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5914727449417114},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5683264136314392},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5649762153625488},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.5644065737724304},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.43083685636520386},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4273115396499634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32520508766174316},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11276376247406006},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08539572358131409}],"concepts":[{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.9682645201683044},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.817107081413269},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7047063708305359},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6205571889877319},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5914727449417114},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5683264136314392},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5649762153625488},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.5644065737724304},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.43083685636520386},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4273115396499634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32520508766174316},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11276376247406006},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08539572358131409},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230180305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230180305","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":12,"referenced_works":["https://openalex.org/W15274158","https://openalex.org/W1983945124","https://openalex.org/W2017695941","https://openalex.org/W2021646400","https://openalex.org/W2039011874","https://openalex.org/W2044807391","https://openalex.org/W2048033806","https://openalex.org/W2056839836","https://openalex.org/W2064284095","https://openalex.org/W2070561727","https://openalex.org/W2081814459","https://openalex.org/W2092395565"],"related_works":["https://openalex.org/W1822681810","https://openalex.org/W2737096452","https://openalex.org/W2473635752","https://openalex.org/W2355014420","https://openalex.org/W1563136009","https://openalex.org/W2059958986","https://openalex.org/W1989850675","https://openalex.org/W3215808204","https://openalex.org/W4243384718","https://openalex.org/W2075582476"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"Capacitated":[2],"Arc":[3],"Routing":[4],"Problem":[5,19],"(CARP),":[6],"a":[7,22,53],"generalization":[8],"of":[9],"the":[10,16,46,63],"arc":[11],"routing":[12],"problems":[13],"such":[14],"as":[15],"Chinese":[17],"Postman":[18],"(CPP),":[20],"is":[21],"very":[23],"practical":[24],"distribution":[25],"management":[26],"problem":[27,64],"which":[28],"has":[29],"many":[30],"real\u2010world":[31],"applications.":[32],"This":[33],"paper":[34],"briefly":[35],"reviews":[36],"two":[37],"existing":[38],"lower":[39,60],"bounding":[40,55],"procedures\u2014the":[41],"Matching":[42],"Lower":[43,49],"Bound":[44],"and":[45],"Node":[47],"Scanning":[48],"Bound,":[50],"then":[51],"introduces":[52],"new":[54],"technique":[56],"to":[57],"provide":[58],"tighter":[59],"bounds":[61],"on":[62],"solutions.":[65]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}