{"id":"https://openalex.org/W2118144058","doi":"https://doi.org/10.1109/enc.2003.1232903","title":"Exploiting surrogate constraint analysis for fixing variables in both bounds for multidimensional knapsack problems","display_name":"Exploiting surrogate constraint analysis for fixing variables in both bounds for multidimensional knapsack problems","publication_year":2004,"publication_date":"2004-02-03","ids":{"openalex":"https://openalex.org/W2118144058","doi":"https://doi.org/10.1109/enc.2003.1232903","mag":"2118144058"},"language":"en","primary_location":{"id":"doi:10.1109/enc.2003.1232903","is_oa":false,"landing_page_url":"https://doi.org/10.1109/enc.2003.1232903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fourth Mexican International Conference on Computer Science, 2003. ENC 2003.","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/I4210111321","display_name":"Universidad de Puebla","ror":"https://ror.org/02rsx0d74","country_code":"MX","type":"education","lineage":["https://openalex.org/I4210111321"]},{"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":["Autonomous University of Puebla, Puebla, Mexico","Sch. of Comput. Sci., Puebla Univ., Mexico"],"affiliations":[{"raw_affiliation_string":"Autonomous University of Puebla, Puebla, Mexico","institution_ids":["https://openalex.org/I721619"]},{"raw_affiliation_string":"Sch. of Comput. Sci., Puebla Univ., Mexico","institution_ids":["https://openalex.org/I4210111321"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068174754","display_name":"Fred Glover","orcid":"https://orcid.org/0000-0001-6945-0438"},"institutions":[{"id":"https://openalex.org/I368840534","display_name":"University of Mississippi","ror":"https://ror.org/02teq1165","country_code":"US","type":"education","lineage":["https://openalex.org/I368840534","https://openalex.org/I4210141039"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"F. Glover","raw_affiliation_strings":["Hearin Center for Enterprise Science, School of Business, University of Mississippi, MS, USA","University of Mississippi"],"affiliations":[{"raw_affiliation_string":"Hearin Center for Enterprise Science, School of Business, University of Mississippi, MS, USA","institution_ids":["https://openalex.org/I368840534"]},{"raw_affiliation_string":"University of Mississippi","institution_ids":["https://openalex.org/I368840534"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108521248"],"corresponding_institution_ids":["https://openalex.org/I4210111321","https://openalex.org/I721619"],"apc_list":null,"apc_paid":null,"fwci":1.6782,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.86066253,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"32","issue":null,"first_page":"263","last_page":"267"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9941999912261963,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9743000268936157,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8816291093826294},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.7791069149971008},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6355907320976257},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6276432275772095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5781816244125366},{"id":"https://openalex.org/keywords/weighting","display_name":"Weighting","score":0.5587558746337891},{"id":"https://openalex.org/keywords/binary-constraint","display_name":"Binary constraint","score":0.5168588757514954},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.5039183497428894},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.48577621579170227},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.45252150297164917},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.43646183609962463},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.41742223501205444},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3830118775367737},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.30097007751464844},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1531979739665985},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09423527121543884},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.07705092430114746}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8816291093826294},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.7791069149971008},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6355907320976257},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6276432275772095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5781816244125366},{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.5587558746337891},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.5168588757514954},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.5039183497428894},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.48577621579170227},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.45252150297164917},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.43646183609962463},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.41742223501205444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3830118775367737},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.30097007751464844},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1531979739665985},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09423527121543884},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.07705092430114746},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C126838900","wikidata":"https://www.wikidata.org/wiki/Q77604","display_name":"Radiology","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/enc.2003.1232903","is_oa":false,"landing_page_url":"https://doi.org/10.1109/enc.2003.1232903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fourth Mexican International Conference on Computer Science, 2003. ENC 2003.","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":38,"referenced_works":["https://openalex.org/W7875117","https://openalex.org/W36858941","https://openalex.org/W234472833","https://openalex.org/W1545379711","https://openalex.org/W1549861824","https://openalex.org/W1563600186","https://openalex.org/W1570502648","https://openalex.org/W1586409345","https://openalex.org/W1600561192","https://openalex.org/W1972497158","https://openalex.org/W1981134802","https://openalex.org/W2015861882","https://openalex.org/W2021328726","https://openalex.org/W2033971020","https://openalex.org/W2040147130","https://openalex.org/W2043513057","https://openalex.org/W2052307457","https://openalex.org/W2053301303","https://openalex.org/W2060322444","https://openalex.org/W2068939774","https://openalex.org/W2081751877","https://openalex.org/W2092141156","https://openalex.org/W2093436788","https://openalex.org/W2096517106","https://openalex.org/W2100890245","https://openalex.org/W2105008868","https://openalex.org/W2106433410","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/W4256012320","https://openalex.org/W6600311309","https://openalex.org/W6601444935","https://openalex.org/W6711782480","https://openalex.org/W6712511194"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W1531664660","https://openalex.org/W2097415053","https://openalex.org/W1519282274","https://openalex.org/W2675278944","https://openalex.org/W2334636689","https://openalex.org/W1536604285","https://openalex.org/W1496100162","https://openalex.org/W1770162292","https://openalex.org/W2032348095"],"abstract_inverted_index":{"The":[0,31],"exploitation":[1],"by":[2,23,36,42,73],"Osorio":[3],"et":[4],"al.":[5],"(2002)":[6],"of":[7,51],"surrogate":[8,32,55],"constraints":[9,27,41],"and":[10,76],"constraint":[11,33,56,67,79],"pairing":[12],"is":[13,34,57],"strengthened":[14],"to":[15,63,81,84],"give":[16],"better":[17],"results":[18],"in":[19,47],"multidimensional":[20],"knapsack":[21],"problems,":[22],"excluding":[24],"simple":[25],"bounding":[26],"as":[28],"component":[29],"constraints.":[30],"obtained":[35],"weighting":[37],"the":[38,48,52,60,77],"original":[39],"problem":[40],"their":[43],"associated":[44],"dual":[45],"values":[46],"LP":[49],"relaxation":[50],"problem.":[53],"This":[54],"paired":[58],"with":[59],"objective":[61],"function":[62],"obtain":[64],"a":[65],"combined":[66],"where":[68],"negative":[69],"variables":[70,75,83],"are":[71],"replaced":[72],"complemented":[74],"resulting":[78],"used":[80],"fix":[82],"zero":[85],"or":[86],"one.":[87]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}