LEADER 02183oam  2200469zu 450 
001 9910872510203321
005 20241212215250.0
024 7 $a10.1109/ENC.2004
035   $a(CKB)1000000000021836
035   $a(SSID)ssj0000451089
035   $a(PQKBManifestationID)12139856
035   $a(PQKBTitleCode)TC0000451089
035   $a(PQKBWorkID)10459030
035   $a(PQKB)11179407
035   $a(NjHacI)991000000000021836
035   $a(EXLCZ)991000000000021836
100   $a20160829d2004      uy 
101 0 $aeng
135   $aur|||||||||||
181   $ctxt
182   $cc
183   $acr
200 10$aFifth Mexican International Conference on Computer Science
210 31$a[Place of publication not identified]$cIEEE Computer Society Press$d2004
215   $a1 online resource (xv, 422 pages) $cillustrations
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$a9780769521602 
311 08$a0769521606 
330   $aThis 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.
606   $aComputer networks$vCongresses
606   $aComputer science$vCongresses
615  0$aComputer networks
615  0$aComputer science
676   $a004.6
700   $aBaeza-Yates$b R.$027470
702   $aCha?vez$b Edgar
702   $aMarroquin$b J. L
801  0$bPQKB
906   $aPROCEEDING
912   $a9910872510203321
996   $aFifth Mexican International Conference on Computer Science$92341849
997   $aUNINA