02183oam 2200469zu 450 991087251020332120241212215250.010.1109/ENC.2004(CKB)1000000000021836(SSID)ssj0000451089(PQKBManifestationID)12139856(PQKBTitleCode)TC0000451089(PQKBWorkID)10459030(PQKB)11179407(NjHacI)991000000000021836(EXLCZ)99100000000002183620160829d2004 uy engur|||||||||||txtccrFifth Mexican International Conference on Computer Science[Place of publication not identified]IEEE Computer Society Press20041 online resource (xv, 422 pages) illustrationsBibliographic Level Mode of Issuance: Monograph9780769521602 0769521606 This work presents a comparative analysis of different types of logic cuts obtained using the dual surrogate properties of multidimensional knapsack problems. Constraint pairing and an initial integer solution are used to combine the dual surrogate constraint with the objective function and generate new constraints. These constraints are used to obtain different type of logic cuts and these cuts are included in the model before solving the problem to optimality with branch and bound. Computational tests were performed in the set of small problems and the first subset of big instances in the OR-library. It can be seen that the presence of logic cuts in the model improved the branch and bound performance lowering the number of nodes in the search tree.Computer networksCongressesComputer scienceCongressesComputer networksComputer science004.6Baeza-Yates R.27470Chávez EdgarMarroquin J. LPQKBPROCEEDING9910872510203321Fifth Mexican International Conference on Computer Science2341849UNINA