Publication Information

{'id': 'https://openalex.org/W3116559812', 'doi': None, 'title': 'Δύο σημαντικοί σταθμοί στην ιστορία του γραμμικού προγραμματισμού : Simplex and Karmarkar’ s Method', 'display_name': 'Δύο σημαντικοί σταθμοί στην ιστορία του γραμμικού προγραμματισμού : Simplex and Karmarkar’ s Method', 'publication_year': 2020, 'publication_date': '2020-02-18', 'ids': {'openalex': 'https://openalex.org/W3116559812', 'mag': '3116559812'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://nemertes.lis.upatras.gr/jspui/handle/10889/13797', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'dissertation', 'type_crossref': 'dissertation', 'indexed_in': [], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5007668576', 'display_name': 'Νίκη Χαϊδοπούλου', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': True, 'raw_author_name': 'Νίκη Χαϊδοπούλου', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5007668576'], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': None, 'has_fulltext': False, 'cited_by_count': 0, 'citation_normalized_percentile': {'value': 0.0, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 0, 'max': 60}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10963', 'display_name': 'Advanced Optimization Algorithms Research', 'score': 0.7899, '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.7899, '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/T11435', 'display_name': 'Polynomial and algebraic computation', 'score': 0.7843, '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/interior-point-method', 'display_name': 'Interior point method', 'score': 0.7864339}, {'id': 'https://openalex.org/keywords/revised-simplex-method', 'display_name': 'Revised simplex method', 'score': 0.71047217}, {'id': 'https://openalex.org/keywords/criss-cross-algorithm', 'display_name': 'Criss-cross algorithm', 'score': 0.69992805}, {'id': 'https://openalex.org/keywords/simplex', 'display_name': 'Simplex', 'score': 0.69964755}], 'concepts': [{'id': 'https://openalex.org/C144521790', 'wikidata': 'https://www.wikidata.org/wiki/Q134164', 'display_name': 'Simplex algorithm', 'level': 3, 'score': 0.8735316}, {'id': 'https://openalex.org/C41045048', 'wikidata': 'https://www.wikidata.org/wiki/Q202843', 'display_name': 'Linear programming', 'level': 2, 'score': 0.83266854}, {'id': 'https://openalex.org/C155253501', 'wikidata': 'https://www.wikidata.org/wiki/Q461992', 'display_name': 'Interior point method', 'level': 2, 'score': 0.7864339}, {'id': 'https://openalex.org/C191157680', 'wikidata': 'https://www.wikidata.org/wiki/Q17085895', 'display_name': 'Revised simplex method', 'level': 4, 'score': 0.71047217}, {'id': 'https://openalex.org/C52486349', 'wikidata': 'https://www.wikidata.org/wiki/Q17006040', 'display_name': 'Criss-cross algorithm', 'level': 4, 'score': 0.69992805}, {'id': 'https://openalex.org/C62438384', 'wikidata': 'https://www.wikidata.org/wiki/Q331350', 'display_name': 'Simplex', 'level': 2, 'score': 0.69964755}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.5945269}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.5682237}, {'id': 'https://openalex.org/C205658194', 'wikidata': 'https://www.wikidata.org/wiki/Q4168281', 'display_name': 'Linear-fractional programming', 'level': 3, 'score': 0.5555508}, {'id': 'https://openalex.org/C311688', 'wikidata': 'https://www.wikidata.org/wiki/Q2393193', 'display_name': 'Time complexity', 'level': 2, 'score': 0.5274668}, {'id': 'https://openalex.org/C80899671', 'wikidata': 'https://www.wikidata.org/wiki/Q1304193', 'display_name': 'Vertex (graph theory)', 'level': 3, 'score': 0.46210963}, {'id': 'https://openalex.org/C90119067', 'wikidata': 'https://www.wikidata.org/wiki/Q43260', 'display_name': 'Polynomial', 'level': 2, 'score': 0.41807127}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.32390368}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.3199544}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.20137867}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.0}, {'id': 'https://openalex.org/C134306372', 'wikidata': 'https://www.wikidata.org/wiki/Q7754', 'display_name': 'Mathematical analysis', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://nemertes.lis.upatras.gr/jspui/handle/10889/13797', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 0, 'referenced_works': [], 'related_works': [], 'abstract_inverted_index': {'Linear': [0], 'programming': [1, 82, 147, 169, 239], 'plays': [2], 'an': [3], 'important': [4, 74], 'role': [5], 'in': [6, 13, 120, 129, 157, 172, 215], 'our': [7], 'lives.': [8], 'Due': [9], 'to': [10, 30, 79, 111, 184, 194, 228, 236], 'revolutionary\r\ndevelopments': [11], 'both': [12, 243], 'computer': [14], 'technology': [15], 'and': [16, 72, 116, 198, 210], 'algorithms': [17], 'for': [18, 145, 167], 'linear': [19, 52, 81, 146, 168, 238], 'optimization,': [20], 'pro-\r\nblems': [21], 'that': [22, 137, 148, 170], 'could': [23], 'not': [24], 'be': [25, 40], 'solved': [26, 41], 'years': [27], 'ago,': [28], 'due': [29], 'a': [31, 112, 161, 234, 237], 'required': [32], 'computational': [33], 'time': [34], 'of': [35, 49, 62, 68, 101, 109, 132, 180, 218], 'one\r\nyear,': [36], 'say,': [37], 'can': [38], 'now': [39], 'within': [42], 'some': [43], 'minutes.': [44], 'Until': [45], '1984,': [46], 'the': [47, 56, 63, 69, 77, 80, 85, 102, 107, 121, 124, 130, 133, 181, 186, 199, 204, 208, 211, 216, 219, 222, 224, 229, 242], 'method': [48, 65, 90, 97, 126, 197, 201, 231], 'choice': [50], 'for\r\nsolving': [51], 'optimization': [53], 'problems': [54], 'was': [55, 192], 'Simplex': [57, 64, 96, 125, 196], 'Method.': [58], 'George': [59], 'Dantzig’s': [60], 'develop-\r\nment': [61], 'is': [66, 140, 213], 'one': [67], 'most': [70, 73], 'popular': [71], 'methods': [75, 209], 'of\r\nfinding': [76], 'solution': [78, 235], 'problems.': [83], 'Since': [84], 'initial': [86], 'formulation': [87], 'in\r\n1947,': [88], 'this': [89, 189], 'has': [91, 127, 149], 'been': [92], 'constantly': [93], 'improved.': [94], 'The': [95, 135], 'proceeds': [98], 'from': [99], 'one\r\nvertex': [100], 'feasible': [103, 182], 'region': [104, 183], 'defined': [105], 'by': [106, 155, 232, 241], 'constraints': [108], 'problem': [110], 'neighboring': [113], 'ver-\r\ntex.': [114], 'Klee': [115], 'Minty': [117], 'showed': [118], 'that,': [119], 'worst': [122], 'case,': [123], 'exponential\r\ncomplexity': [128], 'size': [131], 'problem.': [134], 'question': [136], 'then': [138], 'arises': [139], 'whether': [141], 'there': [142], 'is\r\nanother': [143], 'algorithm': [144, 163, 166, 226], 'polynomial': [150], 'complexity.': [151], 'This': [152], 'question\r\nwas': [153], 'answered': [154], 'Karmarkar': [156], '1984.': [158], 'He': [159], 'produced': [160], 'polynomial-time': [162], 'called': [164], 'the\r\nprojective': [165], 'ran': [171], 'much': [173], 'better': [174], 'time.': [175], 'Karmarkar’s\r\nalgorithm': [176], 'uses': [177], 'interior': [178], 'points': [179], 'approximate': [185], 'optimal': [187], 'solution.\r\nConsequently,': [188], 'master': [190], 'thesis': [191], 'aim': [193], 'study': [195], 'interior\r\npoint': [200], '(Karmarkar': [202], 'Method),': [203], 'principle': [205], 'idea': [206], 'behind': [207], 'theory\r\nthat': [212], 'used': [214], 'development': [217], 'methods.': [220], 'In': [221], 'end,': [223], 'Karmarkar’s': [225], 'is\r\ncompared': [227], 'simplex': [230], 'showing': [233], 'problem\r\nobtained': [240], 'two': [244], 'method.': [245]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W3116559812', 'counts_by_year': [], 'updated_date': '2024-12-30T21:00:12.804551', 'created_date': '2021-01-05'}