{"id":"https://openalex.org/W2069958114","doi":"https://doi.org/10.1002/net.3230210407","title":"Computational development of a lagrangian dual approach for quadratic networks","display_name":"Computational development of a lagrangian dual approach for quadratic networks","publication_year":1991,"publication_date":"1991-07-01","ids":{"openalex":"https://openalex.org/W2069958114","doi":"https://doi.org/10.1002/net.3230210407","mag":"2069958114"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230210407","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230210407","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/A5064602538","display_name":"Jos\u00e9 A. Ventura","orcid":"https://orcid.org/0000-0003-1334-4614"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jose A. Ventura","raw_affiliation_strings":["Department of Industrial and Management Systems Engineering, 207 Hammond Building, The Pennsylvania State University, University Park, Pennsylvania 16802"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Management Systems Engineering, 207 Hammond Building, The Pennsylvania State University, University Park, Pennsylvania 16802","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5064602538"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.1776,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.77164009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"21","issue":"4","first_page":"469","last_page":"485"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9980999827384949,"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.9980999827384949,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9642999768257141,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.6253165602684021},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.624193549156189},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.6121740341186523},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.5507612228393555},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5390552282333374},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5254774689674377},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4421481192111969},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4400824308395386},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.4157485365867615},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3724706768989563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36576324701309204}],"concepts":[{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.6253165602684021},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.624193549156189},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6121740341186523},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.5507612228393555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5390552282333374},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5254774689674377},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4421481192111969},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4400824308395386},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.4157485365867615},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3724706768989563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36576324701309204},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230210407","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230210407","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":33,"referenced_works":["https://openalex.org/W30546340","https://openalex.org/W115980880","https://openalex.org/W175637955","https://openalex.org/W186009904","https://openalex.org/W191607929","https://openalex.org/W595365359","https://openalex.org/W1549741150","https://openalex.org/W1970403725","https://openalex.org/W1977895455","https://openalex.org/W1987755233","https://openalex.org/W2012231377","https://openalex.org/W2012346657","https://openalex.org/W2021285203","https://openalex.org/W2021527565","https://openalex.org/W2024983129","https://openalex.org/W2026265548","https://openalex.org/W2027090377","https://openalex.org/W2032354924","https://openalex.org/W2033982221","https://openalex.org/W2035934281","https://openalex.org/W2041494181","https://openalex.org/W2049368282","https://openalex.org/W2065554534","https://openalex.org/W2085611513","https://openalex.org/W2093187490","https://openalex.org/W2117379131","https://openalex.org/W2143277915","https://openalex.org/W2147380579","https://openalex.org/W2158538154","https://openalex.org/W2316564661","https://openalex.org/W2752061190","https://openalex.org/W3216584063","https://openalex.org/W4206328152"],"related_works":["https://openalex.org/W2018215034","https://openalex.org/W3107945686","https://openalex.org/W2005562358","https://openalex.org/W2381924799","https://openalex.org/W3080334989","https://openalex.org/W1972785655","https://openalex.org/W2358840801","https://openalex.org/W2361122475","https://openalex.org/W2990264654","https://openalex.org/W2349115186"],"abstract_inverted_index":{"Abstract":[0],"A":[1,60],"Lagrangian":[2],"dual":[3,25],"approach":[4],"for":[5,57,114],"large\u2010scale":[6],"quadratic":[7,18],"programs":[8],"due":[9],"to":[10,16,69],"Lin":[11],"and":[12,45,72,112],"Pang":[13],"is":[14,27],"adapted":[15],"the":[17,41,52,92,96],"cost":[19],"network":[20],"flow":[21],"problem.":[22],"The":[23,89],"unconstrained":[24],"problem":[26],"solved":[28],"iteratively":[29],"by":[30,110],"combining":[31],"conjugate":[32,82],"gradient":[33],"directions":[34],"with":[35,67,85,101],"finite":[36],"line\u2010search":[37,87,106],"methods.":[38],"By":[39],"exploiting":[40],"graph":[42],"structure,":[43],"matrix":[44],"vector":[46],"operations":[47],"are":[48],"streamlined":[49],"so":[50],"that":[51],"technique":[53,107],"can":[54],"be":[55],"used":[56],"large":[58],"problems.":[59,117],"computational":[61],"study":[62],"of":[63,80,95,104],"randomly":[64],"generated":[65],"networks":[66],"up":[68],"500":[70],"nodes":[71],"20,000":[73],"arcs":[74],"gives":[75],"a":[76,102,105],"comparison":[77],"between":[78],"combinations":[79],"different":[81],"direction":[83,98],"formulas":[84],"three":[86],"techniques.":[88],"results":[90],"demonstrate":[91],"clear":[93],"superiority":[94],"Polak\u2010Ribiere":[97],"formula":[99],"combined":[100],"variant":[103],"originally":[108],"developed":[109],"Bitran":[111],"Hax":[113],"convex":[115],"knapsack":[116]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-02T08:37:19.008085","created_date":"2025-10-10T00:00:00"}