{"id":"https://openalex.org/W2040134269","doi":"https://doi.org/10.1145/2491845.2491856","title":"Combining interior and exterior simplex type algorithms","display_name":"Combining interior and exterior simplex type algorithms","publication_year":2013,"publication_date":"2013-09-03","ids":{"openalex":"https://openalex.org/W2040134269","doi":"https://doi.org/10.1145/2491845.2491856","mag":"2040134269"},"language":"en","primary_location":{"id":"doi:10.1145/2491845.2491856","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2491845.2491856","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th Panhellenic Conference on Informatics","raw_type":"proceedings-article"},"type":"conference-paper","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/A5015558364","display_name":"Themistoklis Glavelis","orcid":"https://orcid.org/0000-0001-7515-6075"},"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":"Themistoklis Glavelis","raw_affiliation_strings":["University of Macedonia, Thessaloniki, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Macedonia, Thessaloniki, Greece","institution_ids":["https://openalex.org/I192756129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010858186","display_name":"\u039d\u03b9\u03ba\u03cc\u03bb\u03b1\u03bf\u03c2 \u03a0\u03bb\u03cc\u03c3\u03ba\u03b1\u03c2","orcid":"https://orcid.org/0000-0001-5876-9945"},"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":"Nikolaos Ploskas","raw_affiliation_strings":["University of Macedonia, Thessaloniki, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Macedonia, Thessaloniki, Greece","institution_ids":["https://openalex.org/I192756129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001451924","display_name":"Nikolaos Samaras","orcid":"https://orcid.org/0000-0001-8201-7081"},"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":"Nikolaos Samaras","raw_affiliation_strings":["University of Macedonia, Thessaloniki, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Macedonia, Thessaloniki, Greece","institution_ids":["https://openalex.org/I192756129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I192756129"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20143885,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"174","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9868999719619751,"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.984000027179718,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.849079430103302},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.8463922739028931},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.7267186641693115},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6897882223129272},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.6857061386108398},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.564176082611084},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5360085964202881},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4379490911960602},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.42519474029541016},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4188118278980255},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33397355675697327},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.21946439146995544}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.849079430103302},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8463922739028931},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7267186641693115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6897882223129272},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6857061386108398},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.564176082611084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5360085964202881},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4379490911960602},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.42519474029541016},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4188118278980255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33397355675697327},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.21946439146995544},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2491845.2491856","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2491845.2491856","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th Panhellenic Conference on Informatics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1762430620","https://openalex.org/W1965005420","https://openalex.org/W1986414193","https://openalex.org/W2006884874","https://openalex.org/W2010997912","https://openalex.org/W2058062905","https://openalex.org/W2061133142","https://openalex.org/W2085548605","https://openalex.org/W2094456378","https://openalex.org/W2095007759","https://openalex.org/W2119303355","https://openalex.org/W2127470768","https://openalex.org/W2221612704","https://openalex.org/W2481108008","https://openalex.org/W2611147814","https://openalex.org/W6678861937"],"related_works":["https://openalex.org/W2133667137","https://openalex.org/W4233917719","https://openalex.org/W2384679317","https://openalex.org/W1570109187","https://openalex.org/W2151960844","https://openalex.org/W2477407501","https://openalex.org/W1709621369","https://openalex.org/W2181661122","https://openalex.org/W2340578266","https://openalex.org/W1740906858"],"abstract_inverted_index":{"Linear":[0,27],"Programming":[1,28],"(LP)":[2],"is":[3,17,74,117,155,165,183],"a":[4,80,95,101,188],"significant":[5],"research":[6],"area":[7],"in":[8,121,136,225,244],"the":[9,18,37,88,118,122,130,159,166,205,209,226,235,248,252,255],"field":[10],"of":[11,39,44,71,79,97,142,147,151,161,190,208,238,254],"operations":[12],"research.":[13],"The":[14,41,69,145,179],"simplex":[15,65,82],"algorithm":[16,83],"most":[19],"widely":[20],"used":[21],"and":[22,61,93,125,173,251],"well-studied":[23],"method":[24],"for":[25,36],"solving":[26],"problems":[29],"(LPs).":[30],"Many":[31],"algorithms":[32,46,67,154,176],"have":[33,213,231],"been":[34],"proposed":[35,210,256],"solution":[38],"LPs.":[40,223],"vast":[42],"majority":[43],"these":[45],"belong":[47],"to":[48,75,86,109,158,194,200,246],"three":[49],"main":[50],"categories:":[51],"(i)":[52,113],"Simplex-type":[53],"or":[54],"pivoting":[55],"algorithms,":[56],"(ii)":[57,126],"interior-point":[58],"methods":[59,172],"(IPMs)":[60],"(iii)":[62],"exterior":[63,174],"point":[64,171,175,181],"type":[66],"(EPSA).":[68],"aim":[70],"this":[72,164],"paper":[73],"present":[76],"an":[77,91,202],"implementation":[78],"hybrid":[81,106],"that":[84,138,169,182,229,240],"begins":[85],"solve":[87],"LP":[89],"using":[90],"IPM":[92,114,186,241],"after":[94,187],"number":[96,189,237],"iterations":[98,191,239,253],"continues":[99],"with":[100],"primal-dual":[102],"EPSA":[103,127],"algorithm.":[104,257],"This":[105],"approach":[107],"aims":[108],"take":[110],"advantage":[111],"of:":[112],"strengths,":[115,128],"which":[116],"fast":[119,131],"convergence":[120,132],"first":[123,167],"iterations,":[124],"i.e.":[129],"when":[133],"making":[134],"steps":[135],"directions":[137],"are":[139,177],"linear":[140,152],"combinations":[141],"attractive":[143,196],"directions.":[144,197],"idea":[146],"combining":[148],"different":[149],"types":[150],"programming":[153],"not":[156],"new;":[157],"best":[160],"our":[162],"knowledge,":[163],"time":[168,250],"interior":[170,180],"combined.":[178],"calculated":[184],"by":[185],"can":[192],"lead":[193],"such":[195],"In":[198],"order":[199,245],"gain":[201],"insight":[203],"into":[204],"practical":[206],"behavior":[207],"algorithm,":[211],"we":[212,230,233],"performed":[214],"some":[215],"computational":[216,227],"experiments":[217],"over":[218],"sparse":[219],"randomly":[220],"generated":[221],"optimal":[222],"Finally,":[224],"study":[228],"conducted,":[232],"investigate":[234],"adequate":[236],"should":[242],"run":[243],"decrease":[247],"CPU":[249]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}