{"id":"https://openalex.org/W2094885056","doi":"https://doi.org/10.1080/10556780701223541","title":"Anstreicher\u2013Terlaky type monotonic simplex algorithms for linear feasibility problems","display_name":"Anstreicher\u2013Terlaky type monotonic simplex algorithms for linear feasibility problems","publication_year":2007,"publication_date":"2007-04-10","ids":{"openalex":"https://openalex.org/W2094885056","doi":"https://doi.org/10.1080/10556780701223541","mag":"2094885056"},"language":"en","primary_location":{"id":"doi:10.1080/10556780701223541","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780701223541","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5029794288","display_name":"Filiz Bilen","orcid":"https://orcid.org/0000-0002-5202-7403"},"institutions":[{"id":"https://openalex.org/I36515993","display_name":"Eastern Mediterranean University","ror":"https://ror.org/00excyz84","country_code":"CY","type":"education","lineage":["https://openalex.org/I36515993"]}],"countries":["CY"],"is_corresponding":false,"raw_author_name":"Filiz Bilen","raw_affiliation_strings":["Eastern Mediterranean University","Department of Mathematics, Eastern Mediterranean University, Famagusta, North Cyprus#TAB#"],"affiliations":[{"raw_affiliation_string":"Eastern Mediterranean University","institution_ids":["https://openalex.org/I36515993"]},{"raw_affiliation_string":"Department of Mathematics, Eastern Mediterranean University, Famagusta, North Cyprus#TAB#","institution_ids":["https://openalex.org/I36515993"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051539509","display_name":"Zsolt Csizmadia","orcid":null},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Zsolt Csizmadia","raw_affiliation_strings":["Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University","Department of Operations Research, Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University, Hungary"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"Department of Operations Research, Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University, Hungary","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072919774","display_name":"Tibor Ill\u00e9s","orcid":"https://orcid.org/0000-0002-8789-6211"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Tibor Ill\u00e9s","raw_affiliation_strings":["Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University","Department of Operations Research, Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University, Hungary"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"Department of Operations Research, Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University, Hungary","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051539509"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":null,"apc_paid":null,"fwci":0.5071,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.69378214,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"22","issue":"4","first_page":"679","last_page":"695"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9934999942779541,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.988099992275238,"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.7728590965270996},{"id":"https://openalex.org/keywords/degeneracy","display_name":"Degeneracy (biology)","score":0.7344443798065186},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.69222092628479},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.6568891406059265},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6252256035804749},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6243366599082947},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6170032024383545},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.5644088983535767},{"id":"https://openalex.org/keywords/revised-simplex-method","display_name":"Revised simplex method","score":0.4845208525657654},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4319066107273102},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4229412376880646},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4158145487308502},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41178545355796814},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3828922510147095},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36805248260498047},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.25193172693252563},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0662066638469696}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7728590965270996},{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.7344443798065186},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.69222092628479},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.6568891406059265},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6252256035804749},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6243366599082947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6170032024383545},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.5644088983535767},{"id":"https://openalex.org/C191157680","wikidata":"https://www.wikidata.org/wiki/Q17085895","display_name":"Revised simplex method","level":4,"score":0.4845208525657654},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4319066107273102},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4229412376880646},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4158145487308502},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41178545355796814},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3828922510147095},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36805248260498047},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.25193172693252563},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0662066638469696},{"id":"https://openalex.org/C60644358","wikidata":"https://www.wikidata.org/wiki/Q128570","display_name":"Bioinformatics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556780701223541","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780701223541","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:strathprints.strath.ac.uk:28215","is_oa":false,"landing_page_url":"https://strathprints.strath.ac.uk/28215/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402226","display_name":"Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I181647926","host_organization_name":"University of Strathclyde","host_organization_lineage":["https://openalex.org/I181647926"],"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":"PeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1571051474","https://openalex.org/W1580157800","https://openalex.org/W1586233612","https://openalex.org/W1591912906","https://openalex.org/W1965826347","https://openalex.org/W1976179137","https://openalex.org/W1986414193","https://openalex.org/W2014528086","https://openalex.org/W2051085407","https://openalex.org/W2117350831","https://openalex.org/W2127470768","https://openalex.org/W2611147814","https://openalex.org/W4210953350","https://openalex.org/W4251167060"],"related_works":["https://openalex.org/W2384679317","https://openalex.org/W1570109187","https://openalex.org/W2133667137","https://openalex.org/W2491692165","https://openalex.org/W2366013513","https://openalex.org/W187881786","https://openalex.org/W2371263478","https://openalex.org/W2392611548","https://openalex.org/W2911215968","https://openalex.org/W2477407501"],"abstract_inverted_index":{"Based":[0],"on":[1],"the":[2,42,60,64,69,85,89,97,100,104,133,140,144],"pivot":[3,101],"selection":[4],"rule":[5],"[Anstreicher,":[6],"K.M.":[7],"and":[8,66,139],"Terlaky,":[9],"T.,":[10],"1994,":[11],"A":[12],"monotonic":[13,28],"build-up":[14,29],"simplex":[15,31,145],"algorithm":[16,32,47],"for":[17,33,41,132],"linear":[18,34,134],"programming.":[19],"Operations":[20],"Research,":[21],"42,":[22],"556\u2013561.]":[23],"we":[24],"define":[25],"a":[26,51,82,118],"new":[27,119],"(MBU)":[30],"feasibility":[35],"problems.":[36],"An":[37,108],"mK":[38],"upper":[39],"bound":[40,44],"iteration":[43],"of":[45,63,71,84,88,112,137,143],"our":[46,151],"is":[48,57,68,94],"given":[49],"under":[50,150],"weak":[52,152],"non-degeneracy":[53,153],"assumption,":[54],"where":[55],"K":[56,75],"determined":[58],"by":[59,81],"input":[61,90],"data":[62,91],"problem":[65],"m":[67],"number":[70],"constraints.":[72],"The":[73],"constant":[74],"cannot":[76],"be":[77,148],"bounded":[78],"in":[79],"general":[80],"polynomial":[83],"bit":[86],"length":[87],"since":[92],"it":[93],"related":[95],"to":[96,116,122],"determinants":[98],"(of":[99],"tableau)":[102],"with":[103],"highest":[105],"absolute":[106],"value.":[107],"interesting":[109],"local":[110],"property":[111],"degeneracy":[113],"led":[114],"us":[115],"construct":[117],"recursive":[120],"procedure":[121],"handle":[123],"strongly":[124],"degenerate":[125],"problems":[126],"as":[127],"well.":[128],"Analogous":[129],"complexity":[130],"bounds":[131],"programming":[135],"versions":[136],"MBU":[138],"first":[141],"phase":[142],"method":[146],"can":[147],"proved":[149],"assumption.":[154]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}