{"id":"https://openalex.org/W4386734205","doi":"https://doi.org/10.58837/chula.the.2018.332","title":"Preceding-Jump Simplex method","display_name":"Preceding-Jump Simplex method","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W4386734205","doi":"https://doi.org/10.58837/chula.the.2018.332"},"language":"en","primary_location":{"id":"doi:10.58837/chula.the.2018.332","doi":"https://doi.org/10.58837/chula.the.2018.332","is_oa":true,"landing_page_url":"https://doi.org/10.58837/chula.the.2018.332","pdf_url":"http://cuir.car.chula.ac.th/bitstream/123456789/73141/1/Sci_6072049323_Thesis_2018.pdf","source":{"id":"https://openalex.org/S7407060144","display_name":"Chula Digiverse","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Chulalongkorn University","raw_type":"dissertation"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://cuir.car.chula.ac.th/bitstream/123456789/73141/1/Sci_6072049323_Thesis_2018.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092093882","display_name":"Natdanai Kafakthong","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Natdanai Kafakthong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5092093882"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9262999892234802,"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.9262999892234802,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.03680000081658363,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"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.032999999821186066,"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-method","display_name":"simplex method","score":0.8569999933242798},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.8740000128746033},{"id":"https://openalex.org/keywords/heuristic-initialization","display_name":"heuristic initialization","score":0.6330000162124634},{"id":"https://openalex.org/keywords/gradient-based-search","display_name":"gradient search","score":0.5249999761581421},{"id":"https://openalex.org/keywords/feasible-region","display_name":"feasible region","score":0.40799999237060547},{"id":"https://openalex.org/keywords/binding-constraints","display_name":"binding constraints","score":0.5910000205039978},{"id":"https://openalex.org/keywords/iteration-reduction","display_name":"iteration reduction","score":0.7670000195503235},{"id":"https://openalex.org/keywords/large-scale-linear-programming","display_name":"large-scale linear programming","score":0.7289999723434448}],"concepts":[{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.782871663570404},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7695781588554382},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7260552644729614},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7185145616531372},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5884522199630737},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.574723482131958},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.5716304779052734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5104183554649353},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46090683341026306},{"id":"https://openalex.org/C191157680","wikidata":"https://www.wikidata.org/wiki/Q17085895","display_name":"Revised simplex method","level":4,"score":0.4482753276824951},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3811495900154114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3499910533428192},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.310737669467926},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10667648911476135},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.58837/chula.the.2018.332","doi":"https://doi.org/10.58837/chula.the.2018.332","is_oa":true,"landing_page_url":"https://doi.org/10.58837/chula.the.2018.332","pdf_url":"http://cuir.car.chula.ac.th/bitstream/123456789/73141/1/Sci_6072049323_Thesis_2018.pdf","source":{"id":"https://openalex.org/S7407060144","display_name":"Chula Digiverse","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Chulalongkorn University","raw_type":"dissertation"}],"best_oa_location":{"id":"doi:10.58837/chula.the.2018.332","doi":"https://doi.org/10.58837/chula.the.2018.332","is_oa":true,"landing_page_url":"https://doi.org/10.58837/chula.the.2018.332","pdf_url":"http://cuir.car.chula.ac.th/bitstream/123456789/73141/1/Sci_6072049323_Thesis_2018.pdf","source":{"id":"https://openalex.org/S7407060144","display_name":"Chula Digiverse","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Chulalongkorn University","raw_type":"dissertation"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4386734205.pdf","grobid_xml":"https://content.openalex.org/works/W4386734205.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W188170522","https://openalex.org/W1867059769","https://openalex.org/W1974586245","https://openalex.org/W2010997912","https://openalex.org/W2015176580","https://openalex.org/W2038403187","https://openalex.org/W2071563913","https://openalex.org/W2112426560","https://openalex.org/W2123507636","https://openalex.org/W3106092226","https://openalex.org/W4301216918","https://openalex.org/W4388414948","https://openalex.org/W6721783347"],"related_works":["https://openalex.org/W4388414948","https://openalex.org/W7166712388","https://openalex.org/W4386793052","https://openalex.org/W3009977540","https://openalex.org/W3109606681","https://openalex.org/W3216561112","https://openalex.org/W1623728342","https://openalex.org/W805404251","https://openalex.org/W3213760140","https://openalex.org/W2392611548"],"abstract_inverted_index":{"A":[0],"practical":[1],"linear":[2,34,175],"programming":[3,35,176],"solver":[4],"uses":[5],"the":[6,11,28,61,66,78,82,86,93,99,105,128,132,145,149,158,164,188,194],"simplex":[7,67,133,167,190],"method":[8,48,134,168,191],"to":[9,41,49,55,60,116,154,171,180],"identify":[10],"optimal":[12,29,62],"solution":[13],"by":[14,53,74],"iteratively":[15],"searching":[16],"among":[17],"adjacent":[18],"feasible":[19,100,107,119,129],"vertices.":[20],"It":[21,113],"may":[22],"visit":[23],"numerous":[24],"vertices":[25],"before":[26,64],"finding":[27],"one":[30,63,111],"for":[31],"a":[32,38,46,56,117],"large":[33],"problem":[36],"taking":[37],"long":[39],"time":[40],"succeed.":[42],"This":[43],"research":[44],"proposes":[45],"heuristic":[47],"alleviate":[50],"this":[51],"issue":[52],"jumping":[54,76],"new":[57,70],"vertex":[58,71,80,130,151],"close":[59],"performing":[65],"method.":[68],"The":[69,137,183],"is":[72,139,169],"identified":[73],"first":[75,106],"from":[77,152],"initial":[79,150],"along":[81],"gradient":[83],"vector":[84],"of":[85,98,161,178,196],"objective":[87,94],"function":[88],"or":[89],"alternative":[90],"direction":[91,95],"if":[92],"points":[96],"out":[97],"region":[101],"and":[102,198],"stops":[103],"at":[104,110],"point":[108,120,147],"binding":[109,123],"constraint.":[112],"then":[114],"shifts":[115],"neighbor":[118],"preserving":[121],"previous":[122],"constraints":[124],"until":[125],"it":[126],"reaches":[127],"so":[131],"can":[135],"start.":[136],"algorithm":[138],"tested":[140],"on":[141],"synthetic":[142,174],"problems":[143,177],"with":[144],"origin":[146],"as":[148],"100":[153,179],"2500":[155],"variable":[156],"having":[157],"same":[159],"number":[160,195],"constraints.":[162],"Moreover,":[163],"preceding":[165],"jump":[166],"extended":[170],"solve":[172],"general":[173],"1000":[181],"variables.":[182],"experimental":[184],"results":[185],"show":[186],"that":[187],"preceding-jump":[189],"significantly":[192],"reduces":[193],"iterations":[197],"total":[199],"running":[200],"time.":[201]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2023-09-15T00:00:00"}