{"id":"https://openalex.org/W329009252","doi":"https://doi.org/10.21236/ada352010","title":"An Integral Simplex Method for Solving Combinatorial Optimization Problems","display_name":"An Integral Simplex Method for Solving Combinatorial Optimization Problems","publication_year":1996,"publication_date":"1996-07-11","ids":{"openalex":"https://openalex.org/W329009252","doi":"https://doi.org/10.21236/ada352010","mag":"329009252"},"language":"en","primary_location":{"id":"doi:10.21236/ada352010","doi":"https://doi.org/10.21236/ada352010","is_oa":false,"landing_page_url":"http://doi.org/10.21236/ada352010","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"US Dept of the Navy","raw_type":"report"},"volume":null,"type":"report","is_traditional":false,"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/A5042360647","display_name":"Gerald L. Thompson","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gerald L. Thompson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5042360647"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9531000256538391,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9531000256538391,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.027899999171495438,"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.011099999770522118,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/set-partitioning-problem","display_name":"set partitioning","score":0.9350000023841858},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.984000027179718},{"id":"https://openalex.org/keywords/pivot-rules","display_name":"pivot rules","score":0.628000020980835},{"id":"https://openalex.org/keywords/local-optima","display_name":"local optima","score":0.6349999904632568},{"id":"https://openalex.org/keywords/search-trees","display_name":"search trees","score":0.7509999871253967},{"id":"https://openalex.org/keywords/integer-linear-programming","display_name":"integer linear programming","score":0.4390000104904175}],"concepts":[{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.7517142295837402},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5178911685943604},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.47899338603019714},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47843649983406067},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4637414216995239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4199773371219635},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20779404044151306},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.1425686776638031}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21236/ada352010","doi":"https://doi.org/10.21236/ada352010","is_oa":false,"landing_page_url":"http://doi.org/10.21236/ada352010","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"US Dept of the Navy","raw_type":"report"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2011039300","https://openalex.org/W2136023107","https://openalex.org/W2171471009"],"related_works":["https://openalex.org/W1487378147","https://openalex.org/W2140541505","https://openalex.org/W2082860577","https://openalex.org/W59239371","https://openalex.org/W7148223433","https://openalex.org/W2902088816","https://openalex.org/W7099404685","https://openalex.org/W2803699435","https://openalex.org/W2034666582","https://openalex.org/W2955763295"],"abstract_inverted_index":{"Abstract":[0],":":[1],"In":[2],"this":[3],"paper":[4],"a":[5,20,40,52,59,67,72,105,154,173,189],"local":[6,41,48],"integral":[7,61,149],"simplex":[8,62,150],"method":[9,63,151,187],"will":[10,136],"be":[11,93,137],"described":[12],"which,":[13],"starting":[14],"with":[15],"the":[16,27,47,55,82,98,111,117,128,140,147],"initial":[17],"tableau":[18],"of":[19,71,75,78,88,116,143,176],"set":[21,113,155],"partitioning":[22,114,156],"problem,":[23,119],"makes":[24],"pivots":[25,36,144],"using":[26],"pivot":[28],"on":[29],"one":[30,87],"rule":[31],"until":[32],"no":[33,132],"more":[34],"such":[35,197],"are":[37],"possible":[38],"because":[39],"optimum":[42,49,54],"has":[43,104,123,131,188],"been":[44],"found.":[45],"If":[46,101],"is":[50,90,110,163,170,181],"also":[51],"global":[53,60,148,186],"process":[56],"stops.":[57],"Otherwise,":[58],"creates":[64],"and":[65,81],"solves":[66],"search":[68],"tree":[69],"consisting":[70],"polynomial":[73,174,192],"number":[74,142],"subproblems,":[76,79],"subproblems":[77],"etc.,":[80],"solution":[83,96,103,115],"to":[84,92,97,152],"at":[85],"least":[86],"which":[89,183],"guaranteed":[91],"an":[94,124,164],"optimal":[95,112],"original":[99,118,129],"problem.":[100],"that":[102,139,185],"bounded":[106,171],"objective":[107,126],"then":[108,127],"it":[109,122],"but":[120,166],"if":[121],"unbounded":[125],"problem":[130,157],"feasible":[133],"solution.":[134],"It":[135],"shown":[138],"total":[141],"required":[145],"for":[146],"solve":[153],"having":[158],"m":[159,162],"rows,":[160],"where":[161],"arbitrary":[165],"fixed":[167],"positive":[168],"integer,":[169],"by":[172],"function":[175],"n.":[177],"Preliminary":[178],"computational":[179],"experience":[180],"given":[182],"indicates":[184],"low":[190],"order":[191],"empirical":[193],"performance":[194],"when":[195],"solving":[196],"problems.":[198]},"counts_by_year":[],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2016-06-24T00:00:00"}