{"id":"https://openalex.org/W1987960872","doi":"https://doi.org/10.1002/(sici)1097-0037(199601)27:1<81::aid-net7>3.0.co;2-a","title":"Package routing in transportation networks with fixed vehicle schedules","display_name":"Package routing in transportation networks with fixed vehicle schedules","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1987960872","doi":"https://doi.org/10.1002/(sici)1097-0037(199601)27:1<81::aid-net7>3.0.co;2-a","mag":"1987960872"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199601)27:1<81::aid-net7>3.0.co;2-a","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199601)27:1<81::aid-net7>3.0.co;2-a","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/A5030851488","display_name":"Lloyd Greenwald","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lloyd Greenwald","raw_affiliation_strings":["Department of Computer Science, Brown University, Box 1910, Providence, Rhode Island 02912"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, Box 1910, Providence, Rhode Island 02912","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5097254658","display_name":"and Thomas Dean","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"and Thomas Dean","raw_affiliation_strings":["Department of Computer Science, Brown University, Box 1910, Providence, Rhode Island 02912"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, Box 1910, Providence, Rhode Island 02912","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030851488"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.16789735,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":"1","first_page":"81","last_page":"93"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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/T12176","display_name":"Optimization and Packing Problems","score":0.9782000184059143,"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/T10661","display_name":"biodegradable polymer synthesis and properties","score":0.975600004196167,"subfield":{"id":"https://openalex.org/subfields/2502","display_name":"Biomaterials"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials 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.6859944462776184},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6510424613952637},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6366703510284424},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6210505962371826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6156604886054993},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5756248235702515},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5530449151992798},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5265729427337646},{"id":"https://openalex.org/keywords/transportation-theory","display_name":"Transportation theory","score":0.4673379361629486},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4610231816768646},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.41932979226112366},{"id":"https://openalex.org/keywords/fixed-cost","display_name":"Fixed cost","score":0.41210681200027466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27226313948631287},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09028884768486023},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08088994026184082}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6859944462776184},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6510424613952637},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6366703510284424},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6210505962371826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6156604886054993},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5756248235702515},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5530449151992798},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5265729427337646},{"id":"https://openalex.org/C31829261","wikidata":"https://www.wikidata.org/wiki/Q1929885","display_name":"Transportation theory","level":2,"score":0.4673379361629486},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4610231816768646},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.41932979226112366},{"id":"https://openalex.org/C42866809","wikidata":"https://www.wikidata.org/wiki/Q466764","display_name":"Fixed cost","level":2,"score":0.41210681200027466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27226313948631287},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09028884768486023},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08088994026184082},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","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},{"id":"https://openalex.org/C24326235","wikidata":"https://www.wikidata.org/wiki/Q126095","display_name":"Electronic engineering","level":1,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199601)27:1<81::aid-net7>3.0.co;2-a","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199601)27:1<81::aid-net7>3.0.co;2-a","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.9968","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.9968","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mcs.drexel.edu/~lgreenwa/finalpackage.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.3798","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.3798","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/people/tld/postscript/GreenwaldandDeanNETWORKS-96.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4231500168","https://openalex.org/W90079504","https://openalex.org/W2032436423","https://openalex.org/W2069737189","https://openalex.org/W3141113327","https://openalex.org/W3035974271","https://openalex.org/W2374451529","https://openalex.org/W1561045713","https://openalex.org/W2278302102","https://openalex.org/W2586500827"],"abstract_inverted_index":{"We":[0,78,125],"consider":[1],"a":[2,68,73,97],"special":[3,21],"case":[4],"of":[5,12,25,92,114,117,129,140],"the":[6,10,23,26,87,93,115,118,127,130],"general":[7],"problem":[8,51,66,71,94],"involving":[9],"routing":[11],"packages":[13,31],"among":[14],"vehicles":[15,27,38,41],"in":[16,112,120],"transportation":[17],"networks.":[18],"In":[19,61],"this":[20,50,65,141],"case,":[22],"schedules":[24],"are":[28,32],"fixed":[29,47],"and":[30,104,137],"routed":[33],"by":[34],"transferring":[35],"them":[36],"between":[37],"as":[39,67],"these":[40],"make":[42],"stops":[43],"according":[44],"to":[45,95,133],"their":[46],"schedules.":[48],"Since":[49],"is":[52,110],"NP-complete,":[53],"we":[54,63],"explore":[55],"approximation":[56],"algorithms":[57],"for":[58],"its":[59],"solution.":[60],"particular,":[62],"cast":[64],"multicommodity":[69],"flow":[70],"with":[72,99],"mixed":[74],"integer/linear":[75],"program":[76],"formulation.":[77],"then":[79],"apply":[80],"combinatorial":[81],"optimization":[82],"techniques":[83],"based":[84],"on":[85],"solving":[86],"relaxed":[88],"linear":[89],"programming":[90],"formulation":[91],"obtain":[96],"solution":[98],"provable":[100],"constraint":[101],"violation":[102],"bounds":[103],"expected":[105],"performance":[106,109,131],"guarantees,":[107],"where":[108],"measured":[111],"terms":[113],"sum":[116],"time":[119],"transit":[121],"over":[122],"all":[123],"packages.":[124],"investigate":[126],"sensitivity":[128],"guarantees":[132],"certain":[134],"scaling":[135],"factors":[136],"other":[138],"limitations":[139],"technique.":[142],"\u00a9":[143],"1996":[144],"John":[145],"Wiley":[146],"&":[147],"Sons,":[148],"Inc.":[149]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}