{"id":"https://openalex.org/W2352211938","doi":null,"title":"A New Implicit Enumerative Algorithm for Integer Linear Programs","display_name":"A New Implicit Enumerative Algorithm for Integer Linear Programs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2352211938","mag":"2352211938"},"language":"en","primary_location":{"id":"mag:2352211938","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-QFSF201001005.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2765000394","display_name":"Journal of Qufu Normal University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4360969423","host_organization_name":"Qufu Normal University","host_organization_lineage":["https://openalex.org/P4360969423"],"host_organization_lineage_names":["Qufu Normal University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Qufu Normal University","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5056500556","display_name":"Gao Pei-wang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I163732180","display_name":"Guangxi University of Finance and Economics","ror":"https://ror.org/02ayg6516","country_code":"CN","type":"education","lineage":["https://openalex.org/I163732180"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Gao Pei-wang","raw_affiliation_strings":["Department of Mathematics and Statistics,Guangxi University of Finance and Economics,530003,Nanning,Guangxi,PRC)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics,Guangxi University of Finance and Economics,530003,Nanning,Guangxi,PRC)","institution_ids":["https://openalex.org/I163732180"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056500556"],"corresponding_institution_ids":["https://openalex.org/I163732180"],"apc_list":null,"apc_paid":null,"fwci":0.0,"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":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.46070000529289246,"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.46070000529289246,"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.31690001487731934,"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.20630000531673431,"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/integer-linear-programming","display_name":"integer linear programming","score":0.9819999933242798},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"linear programming relaxation","score":0.7369999885559082}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.692322313785553},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6816211938858032},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6290712356567383},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6185057163238525},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.6148785352706909},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.6025312542915344},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.600186288356781},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5966504812240601},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5892077088356018},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5402843952178955},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.49226847290992737},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4823414981365204},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.47640764713287354},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.47433891892433167},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.4507947266101837},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.4190571904182434},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40330496430397034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.258905827999115},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2099454402923584},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2352211938","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-QFSF201001005.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2765000394","display_name":"Journal of Qufu Normal University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4360969423","host_organization_name":"Qufu Normal University","host_organization_lineage":["https://openalex.org/P4360969423"],"host_organization_lineage_names":["Qufu Normal University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Qufu Normal University","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2370951264","https://openalex.org/W1587953391","https://openalex.org/W2038773690","https://openalex.org/W2272677643","https://openalex.org/W2114038357","https://openalex.org/W7095554193","https://openalex.org/W2365803335","https://openalex.org/W2351457120","https://openalex.org/W249263462","https://openalex.org/W2070126933"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,21,40,81,89],"new":[4],"implicit":[5],"enumerative":[6],"algorithm":[7,108],"for":[8],"integer":[9,53],"linear":[10,34],"programming":[11,35],"problems.In":[12],"the":[13,28,33,43,46,56,65,71,76,79,92,107],"algorithm,the":[14],"objective":[15,24],"function":[16,25],"is":[17,68,85,103,110,113],"changed":[18],"down":[19],"as":[20],"parameter.Therefore,the":[22],"associated":[23],"hyperplane":[26],"intersects":[27],"binding":[29],"cone":[30],"polyhedron":[31],"of":[32,45,58,78,114],"relaxation":[36],"problem":[37,73],"to":[38,74,87,91],"generate":[39],"simplex,by":[41],"which":[42],"intervals":[44,57],"variables":[47],"can":[48],"be":[49],"determined.Next,if":[50],"there":[51],"are":[52],"numbers":[54],"in":[55],"all":[59],"variables,an":[60],"auxiliary":[61],"equality":[62],"constraint":[63],"with":[64],"right-hand-side":[66],"parameter":[67],"introduced":[69],"into":[70],"original":[72],"improve":[75],"bounds":[77],"variables.Then":[80],"stopped":[82],"search":[83],"process":[84],"applied":[86],"find":[88],"solution":[90],"problem.Finally,the":[93],"computational":[94],"test":[95],"on":[96],"some":[97,115],"classical":[98],"and":[99],"randomly-generated":[100],"numerical":[101],"examples":[102],"made.It":[104],"shows":[105],"that":[106],"presented":[109],"convenient,and":[111],"it":[112],"practical":[116],"interests.":[117]},"counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}