{"id":"https://openalex.org/W2145455433","doi":"https://doi.org/10.1051/ro/2012015","title":"On a dual network exterior point simplex type algorithm and its computational behavior","display_name":"On a dual network exterior point simplex type algorithm and its computational behavior","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2145455433","doi":"https://doi.org/10.1051/ro/2012015","mag":"2145455433"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2012015","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2012015","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ro/2012015.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071567691","display_name":"George Geranis","orcid":null},"institutions":[{"id":"https://openalex.org/I192756129","display_name":"University of Macedonia","ror":"https://ror.org/05fg6gr82","country_code":"GR","type":"education","lineage":["https://openalex.org/I192756129"]},{"id":"https://openalex.org/I4210094138","display_name":"University of West Attica","ror":"https://ror.org/00r2r5k05","country_code":"GR","type":"education","lineage":["https://openalex.org/I4210094138"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"George Geranis","raw_affiliation_strings":["Department of Applied Informatics, University of Macedonia, 156 Egnatia Str., 54006 Thessaloniki, Greece","Department of Applied Informatics, University ofMacedonia, 156 EgnatiaStr., 54006Thessaloniki,Greece.  geranis@uom.gr; paparriz@uom.gr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Informatics, University of Macedonia, 156 Egnatia Str., 54006 Thessaloniki, Greece","institution_ids":["https://openalex.org/I192756129"]},{"raw_affiliation_string":"Department of Applied Informatics, University ofMacedonia, 156 EgnatiaStr., 54006Thessaloniki,Greece.  geranis@uom.gr; paparriz@uom.gr","institution_ids":["https://openalex.org/I4210094138","https://openalex.org/I192756129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112044420","display_name":"Konstantinos Paparrizos","orcid":null},"institutions":[{"id":"https://openalex.org/I192756129","display_name":"University of Macedonia","ror":"https://ror.org/05fg6gr82","country_code":"GR","type":"education","lineage":["https://openalex.org/I192756129"]},{"id":"https://openalex.org/I4210094138","display_name":"University of West Attica","ror":"https://ror.org/00r2r5k05","country_code":"GR","type":"education","lineage":["https://openalex.org/I4210094138"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Konstantinos Paparrizos","raw_affiliation_strings":["Department of Applied Informatics, University of Macedonia, 156 Egnatia Str., 54006 Thessaloniki, Greece","Department of Applied Informatics, University ofMacedonia, 156 EgnatiaStr., 54006Thessaloniki,Greece.  geranis@uom.gr; paparriz@uom.gr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Informatics, University of Macedonia, 156 Egnatia Str., 54006 Thessaloniki, Greece","institution_ids":["https://openalex.org/I192756129"]},{"raw_affiliation_string":"Department of Applied Informatics, University ofMacedonia, 156 EgnatiaStr., 54006Thessaloniki,Greece.  geranis@uom.gr; paparriz@uom.gr","institution_ids":["https://openalex.org/I4210094138","https://openalex.org/I192756129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016698691","display_name":"Angelo Sifaleras","orcid":"https://orcid.org/0000-0002-5696-7021"},"institutions":[{"id":"https://openalex.org/I192756129","display_name":"University of Macedonia","ror":"https://ror.org/05fg6gr82","country_code":"GR","type":"education","lineage":["https://openalex.org/I192756129"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Angelo Sifaleras","raw_affiliation_strings":["Department of Technology Management, University of Macedonia, Loggou-Tourpali, 59200 Naoussa, Greece","Department of Technology Management, University ofMacedonia, Loggou-Tourpali, 59200Naoussa,Greece;  sifalera@uom.gr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Technology Management, University of Macedonia, Loggou-Tourpali, 59200 Naoussa, Greece","institution_ids":["https://openalex.org/I192756129"]},{"raw_affiliation_string":"Department of Technology Management, University ofMacedonia, Loggou-Tourpali, 59200Naoussa,Greece;  sifalera@uom.gr","institution_ids":["https://openalex.org/I192756129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.166,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.93844742,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"46","issue":"3","first_page":"211","last_page":"234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9948999881744385,"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.9948999881744385,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10374","display_name":"Advanced Graph Theory Research","score":0.9916999936103821,"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/simplex-algorithm","display_name":"Simplex algorithm","score":0.6956823468208313},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6870255470275879},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.6764420866966248},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.6119272112846375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5315494537353516},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5215420722961426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5054154396057129},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.4461193084716797},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43529611825942993},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.435286283493042},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43408501148223877},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.2928656041622162},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12108370661735535}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.6956823468208313},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6870255470275879},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6764420866966248},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6119272112846375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5315494537353516},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5215420722961426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5054154396057129},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4461193084716797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43529611825942993},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.435286283493042},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43408501148223877},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2928656041622162},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12108370661735535},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro/2012015","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2012015","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2012__46_3_211_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2012015/","pdf_url":"https://www.numdam.org/item/10.1051/ro/2012015.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.715.4148","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.715.4148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://users.uom.gr/%7Esifalera/papers/On_a_dual_network_exterior_point_simplex_type_algorithm_and_its_computational_behavior.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_2012__46_3_211_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2012015/","pdf_url":"https://www.numdam.org/item/10.1051/ro/2012015.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320318294","display_name":"University of Macedonia","ror":"https://ror.org/05fg6gr82"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2145455433.pdf"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1503068524","https://openalex.org/W1515029502","https://openalex.org/W1561880747","https://openalex.org/W1936317424","https://openalex.org/W1963951527","https://openalex.org/W1965826347","https://openalex.org/W1977545325","https://openalex.org/W1981832641","https://openalex.org/W2005630705","https://openalex.org/W2008772536","https://openalex.org/W2017267193","https://openalex.org/W2018732369","https://openalex.org/W2019224774","https://openalex.org/W2019426053","https://openalex.org/W2022163094","https://openalex.org/W2033982221","https://openalex.org/W2035720085","https://openalex.org/W2050699940","https://openalex.org/W2054071769","https://openalex.org/W2060088365","https://openalex.org/W2062450536","https://openalex.org/W2075621973","https://openalex.org/W2084224084","https://openalex.org/W2089016801","https://openalex.org/W2092572272","https://openalex.org/W2117849190","https://openalex.org/W2130306715","https://openalex.org/W2144908531","https://openalex.org/W2153707499","https://openalex.org/W2159046795","https://openalex.org/W2182811131","https://openalex.org/W2408225058","https://openalex.org/W2496563976"],"related_works":["https://openalex.org/W2185826091","https://openalex.org/W2048470382","https://openalex.org/W25030584","https://openalex.org/W2477407501","https://openalex.org/W2384679317","https://openalex.org/W2911215968","https://openalex.org/W2151960844","https://openalex.org/W1583787753","https://openalex.org/W1570109187","https://openalex.org/W2730708452"],"abstract_inverted_index":{"The":[0,168],"minimum":[1],"cost":[2],"network":[3,12,19,47],"flow":[4,13],"problem,":[5],"(MCNFP)":[6],"constitutes":[7],"a":[8,16,35,55,61,67,92,134,150],"wide":[9],"category":[10],"of":[11,63,130,132,139,153,166,173,180],"problems.":[14],"Recently":[15],"new":[17,86,160],"dual":[18,46,56,74,93,106],"exterior":[20],"point":[21,38],"simplex":[22,39,48],"algorithm":[23,32,49,52,87],"(DNEPSA)":[24],"for":[25,104,114,123],"the":[26,44,83,85,105,110,115,124,127,154,163,171],"MCNFP":[27],"has":[28],"been":[29],"developed.":[30],"This":[31],"belongs":[33],"to":[34,43,82,176],"special":[36],"\u201cexterior":[37],"type\u201d":[40],"category.":[41],"Similar":[42],"classical":[45],"(DNSA),":[50],"this":[51,119],"starts":[53],"with":[54],"feasible":[57,94],"tree-solution":[58],"and":[59,73,108,141,145,157,183],"after":[60],"number":[62],"iterations,":[64],"it":[65,77,97],"produces":[66,98],"solution":[68],"that":[69,100],"is":[70,78],"both":[71],"primal":[72,116],"feasible,":[75],"i.e.":[76],"optimal.":[79],"However,":[80],"contrary":[81],"DNSA,":[84],"does":[88],"not":[89],"always":[90],"maintain":[91],"solution.":[95],"Instead,":[96],"tree-solutions":[99],"can":[101],"be":[102],"infeasible":[103,113],"problem":[107,148],"at":[109],"same":[111],"time":[112,182],"problem.":[117],"In":[118],"paper,":[120],"we":[121],"present":[122],"first":[125],"time,":[126],"mathematical":[128],"proof":[129],"correctness":[131],"DNEPSA,":[133],"detailed":[135],"comparative":[136],"computational":[137],"study":[138],"DNEPSA":[140,174],"DNSA":[142,177],"on":[143,162],"sparse":[144],"dense":[146],"random":[147],"instances,":[149],"statistical":[151],"analysis":[152,169],"experimental":[155],"results,":[156],"finally":[158],"some":[159],"results":[161],"empirical":[164],"complexity":[165],"DNEPSA.":[167],"proves":[170],"superiority":[172],"compared":[175],"in":[178],"terms":[179],"cpu":[181],"iterations.":[184]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}