{"id":"https://openalex.org/W1993934028","doi":"https://doi.org/10.1002/net.3230240202","title":"A fast algorithm for bounded generalized processing networks","display_name":"A fast algorithm for bounded generalized processing networks","publication_year":1994,"publication_date":"1994-03-01","ids":{"openalex":"https://openalex.org/W1993934028","doi":"https://doi.org/10.1002/net.3230240202","mag":"1993934028"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230240202","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230240202","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/A5063034902","display_name":"J. David Fuller","orcid":"https://orcid.org/0000-0003-2364-5883"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"J. David Fuller","raw_affiliation_strings":["Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1","Department of Management Sciences , University of Waterloo , Waterloo, Ontario, Canada , N2L 3G1"],"affiliations":[{"raw_affiliation_string":"Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Management Sciences , University of Waterloo , Waterloo, Ontario, Canada , N2L 3G1","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101753056","display_name":"B. Lan","orcid":"https://orcid.org/0009-0008-2765-9311"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"B. Lan","raw_affiliation_strings":["Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1","Department of Management Sciences , University of Waterloo , Waterloo, Ontario, Canada , N2L 3G1"],"affiliations":[{"raw_affiliation_string":"Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Management Sciences , University of Waterloo , Waterloo, Ontario, Canada , N2L 3G1","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063034902"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1299709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"2","first_page":"57","last_page":"67"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6821075677871704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5553591847419739},{"id":"https://openalex.org/keywords/minos","display_name":"MINOS","score":0.5387850999832153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5153421759605408},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49145519733428955},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.49111267924308777},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4771439731121063},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.46228814125061035},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.44360464811325073},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43806105852127075}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6821075677871704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5553591847419739},{"id":"https://openalex.org/C2780314645","wikidata":"https://www.wikidata.org/wiki/Q654219","display_name":"MINOS","level":4,"score":0.5387850999832153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5153421759605408},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49145519733428955},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.49111267924308777},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4771439731121063},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.46228814125061035},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44360464811325073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43806105852127075},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C186453547","wikidata":"https://www.wikidata.org/wiki/Q2126","display_name":"Neutrino","level":2,"score":0.0},{"id":"https://openalex.org/C185544564","wikidata":"https://www.wikidata.org/wiki/Q81197","display_name":"Nuclear physics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C107966497","wikidata":"https://www.wikidata.org/wiki/Q509021","display_name":"Neutrino oscillation","level":3,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230240202","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230240202","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":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W104308008","https://openalex.org/W1600350184","https://openalex.org/W1970135106","https://openalex.org/W2007037230","https://openalex.org/W2019740846","https://openalex.org/W2031740021","https://openalex.org/W2046222814","https://openalex.org/W2049421260","https://openalex.org/W2076840393","https://openalex.org/W2100922675","https://openalex.org/W2115424664","https://openalex.org/W2128498640","https://openalex.org/W2147771379"],"related_works":["https://openalex.org/W1972560491","https://openalex.org/W2548576047","https://openalex.org/W2794772518","https://openalex.org/W2951222895","https://openalex.org/W3125649407","https://openalex.org/W3099101507","https://openalex.org/W2008258423","https://openalex.org/W836555340","https://openalex.org/W2479510122","https://openalex.org/W937990293"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"bounded":[2],"generalized":[3,13,57],"processing":[4],"network":[5,58],"model":[6],"has":[7],"the":[8,49,69,85,93,102,110,126,139,147,150,153,157,166],"structure":[9,51],"of":[10,48,56,87,101,138,165],"a":[11,42,54,65],"cost\u2010minimizing":[12],"network,":[14],"with":[15,114],"additional":[16],"side":[17],"constraints":[18,143,159],"that,":[19],"for":[20],"flows":[21,34],"on":[22,35,125],"some":[23],"arcs,":[24],"place":[25],"upper":[26],"and":[27,40,109],"lower":[28],"bounds":[29],"that":[30,45],"are":[31,62,144],"proportional":[32],"to":[33,80,152,160],"other":[36],"arcs.":[37],"We":[38],"propose":[39],"test":[41,128,154],"heuristic":[43],"algorithm":[44,75,79,94,118,131],"takes":[46],"advantage":[47,112],"near\u2010network":[50],"by":[52,68],"solving":[53],"sequence":[55],"LPs":[59],"whose":[60],"data":[61],"adjusted":[63],"in":[64,146],"manner":[66],"suggested":[67],"solution":[70],"at":[71,84,162],"previous":[72],"steps.":[73],"The":[74,117,130,141],"extends":[76],"an":[77],"earlier":[78],"achieve":[81],"better":[82],"solutions,":[83],"cost":[86],"more":[88],"computing":[89],"effort.":[90],"In":[91],"tests,":[92],"is":[95,99,119],"much":[96],"faster":[97,122],"than":[98,123],"application":[100],"general":[103],"purpose":[104],"linear":[105],"programming":[106],"code":[107],"MINOS,":[108],"speed":[111],"increases":[113],"problem":[115],"size:":[116],"27":[120],"times":[121],"MINOS":[124],"largest":[127],"problem.":[129],"almost":[132],"always":[133],"obtains":[134],"solutions":[135,151],"within":[136],"0.05%":[137],"optimum.":[140],"proportionality":[142,158,168],"relaxed":[145],"algorithm,":[148],"yet":[149],"problems":[155],"satisfy":[156],"within,":[161],"worst,":[163],"0.25%":[164],"given":[167],"limits.":[169],"\u00a9":[170],"1994":[171],"John":[172],"Wiley":[173],"&":[174],"Sons,":[175],"Inc.":[176]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}