{"id":"https://openalex.org/W2131711034","doi":"https://doi.org/10.1109/enc.2004.1342620","title":"Cutting analysis for MKP","display_name":"Cutting analysis for MKP","publication_year":2004,"publication_date":"2004-11-08","ids":{"openalex":"https://openalex.org/W2131711034","doi":"https://doi.org/10.1109/enc.2004.1342620","mag":"2131711034"},"language":"en","primary_location":{"id":"doi:10.1109/enc.2004.1342620","is_oa":false,"landing_page_url":"https://doi.org/10.1109/enc.2004.1342620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","raw_type":"proceedings-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/A5108521248","display_name":"Mar\u0131\u0301a A. Osorio","orcid":null},"institutions":[{"id":"https://openalex.org/I721619","display_name":"Benem\u00e9rita Universidad Aut\u00f3noma de Puebla","ror":"https://ror.org/03p2z7827","country_code":"MX","type":"education","lineage":["https://openalex.org/I721619"]}],"countries":["MX"],"is_corresponding":true,"raw_author_name":"M.A. Osorio","raw_affiliation_strings":["School of Computer Sciences, Ciudad Universitaria, Puebla, M\u00e9xico","School of Computer Sciences, Universidad Autonoma de Puebla, Ciudad, Puebla, Mexico"],"affiliations":[{"raw_affiliation_string":"School of Computer Sciences, Ciudad Universitaria, Puebla, M\u00e9xico","institution_ids":[]},{"raw_affiliation_string":"School of Computer Sciences, Universidad Autonoma de Puebla, Ciudad, Puebla, Mexico","institution_ids":["https://openalex.org/I721619"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112436285","display_name":"E. G. Hernandez","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"E.G. Hernandez","raw_affiliation_strings":["School of Computer Sciences, Ciudad Universitaria, Puebla, M\u00e9xico"],"affiliations":[{"raw_affiliation_string":"School of Computer Sciences, Ciudad Universitaria, Puebla, M\u00e9xico","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108521248"],"corresponding_institution_ids":["https://openalex.org/I721619"],"apc_list":null,"apc_paid":null,"fwci":2.5173,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.89710145,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"874","issue":null,"first_page":"298","last_page":"303"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9574999809265137,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/knapsack-problem","display_name":"Knapsack problem","score":0.7759312987327576},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6724411249160767},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6655145883560181},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6139072179794312},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5651682019233704},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5280759334564209},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5161246061325073},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.47942060232162476},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4594070017337799},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.45862334966659546},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4527192711830139},{"id":"https://openalex.org/keywords/pairing","display_name":"Pairing","score":0.44369715452194214},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43223634362220764},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4160327911376953},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4112665057182312},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.36617863178253174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36003273725509644},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.20162203907966614},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11756470799446106}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7759312987327576},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6724411249160767},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6655145883560181},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6139072179794312},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5651682019233704},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5280759334564209},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5161246061325073},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.47942060232162476},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4594070017337799},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.45862334966659546},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4527192711830139},{"id":"https://openalex.org/C14103023","wikidata":"https://www.wikidata.org/wiki/Q11681459","display_name":"Pairing","level":3,"score":0.44369715452194214},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43223634362220764},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4160327911376953},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4112665057182312},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.36617863178253174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36003273725509644},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.20162203907966614},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11756470799446106},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C54101563","wikidata":"https://www.wikidata.org/wiki/Q124131","display_name":"Superconductivity","level":2,"score":0.0},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/enc.2004.1342620","is_oa":false,"landing_page_url":"https://doi.org/10.1109/enc.2004.1342620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W234472833","https://openalex.org/W1549861824","https://openalex.org/W1563600186","https://openalex.org/W1570502648","https://openalex.org/W1586409345","https://openalex.org/W1600561192","https://openalex.org/W1981134802","https://openalex.org/W2033971020","https://openalex.org/W2043513057","https://openalex.org/W2060322444","https://openalex.org/W2062718129","https://openalex.org/W2081751877","https://openalex.org/W2093436788","https://openalex.org/W2096517106","https://openalex.org/W2100890245","https://openalex.org/W2106433410","https://openalex.org/W2118144058","https://openalex.org/W2134094348","https://openalex.org/W2171682893","https://openalex.org/W2395359188","https://openalex.org/W2399250890","https://openalex.org/W4230045511","https://openalex.org/W4232237275","https://openalex.org/W6711782480","https://openalex.org/W6712511194"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W1531664660","https://openalex.org/W1597500234","https://openalex.org/W1567852657","https://openalex.org/W2097415053","https://openalex.org/W1551947503","https://openalex.org/W2136516061","https://openalex.org/W1504425306","https://openalex.org/W138340681","https://openalex.org/W2097523953"],"abstract_inverted_index":{"This":[0],"work":[1],"presents":[2],"a":[3],"comparative":[4],"analysis":[5],"of":[6,9,18,53,81,88,101,116],"different":[7,51],"types":[8],"logic":[10,54,102],"cuts":[11,55,58,103],"obtained":[12],"using":[13],"the":[14,33,38,62,66,79,85,92,99,105,108,114,119],"dual":[15,34],"surrogate":[16,35],"properties":[17],"multidimensional":[19],"knapsack":[20],"problems.":[21],"Constraint":[22],"pairing":[23],"and":[24,41,56,72,84,110],"an":[25],"initial":[26],"integer":[27],"solution":[28],"are":[29,47,59],"used":[30,48],"to":[31,49,68],"combine":[32],"constraint":[36],"with":[37,70],"objective":[39],"function":[40],"generate":[42],"new":[43],"constraints.":[44],"These":[45],"constraints":[46],"obtain":[50],"type":[52],"these":[57],"included":[60],"in":[61,78,91,104,118],"model":[63,106],"before":[64],"solving":[65],"problem":[67],"optimality":[69],"branch":[71,109],"bound.":[73],"Computational":[74],"tests":[75],"were":[76],"performed":[77],"set":[80],"small":[82],"problems":[83],"first":[86],"subset":[87],"big":[89],"instances":[90],"OR-library.":[93],"It":[94],"can":[95],"be":[96],"seen":[97],"that":[98],"presence":[100],"improved":[107],"bound":[111],"performance":[112],"lowering":[113],"number":[115],"nodes":[117],"search":[120],"tree.":[121]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}