Publicación:
THE QUADRATIC KNAPSACK PROBLEM WITH SETUP

Vista sencilla de ítem
dc.creatorCARLOS RODRIGO REY BARRA
dc.date2024
dc.date.accessioned2025-01-10T15:53:09Z
dc.date.available2025-01-10T15:53:09Z
dc.date.issued2024
dc.description.abstractTHE QUADRATIC KNAPSACK PROBLEM IS A WELL-KNOWN GENERALIZATION OF THE CLASSICAL 0-1 KNAPSACK PROBLEM, IN WHICH ANY PAIR OF ITEMS PRODUCES A PAIRWISE PROFIT IF BOTH ARE SELECTED. ANOTHER RELEVANT GENERALIZATION OF THE KNAPSACK PROBLEM IS THE KNAPSACK PROBLEM WITH SETUP, IN WHICH THE ITEMS ARE PARTITIONED INTO CLASSES, THE ITEMS OF A CLASS CAN ONLY BE INSERTED INTO THE KNAPSACK IF THE CORRESPONDING CLASS IS ACTIVATED, AND ACTIVATING A CLASS INVOLVES A SETUP COST AND A SETUP CAPACITY REDUCTION. DESPITE A RICH LITERATURE ON THESE TWO PROBLEMS, THEIR OBVIOUS GENERALIZATION, I.E., THE QUADRATIC KNAPSACK PROBLEM WITH SETUP, WAS NEVER INVESTIGATED SO FAR. WE DISCUSS APPLICATIONS, MATHEMATICAL MODELS, DETERMINISTIC MATHEURISTIC ALGORITHMS, AND COMPUTATIONALLY EVALUATE THEIR PERFORMANCE.
dc.formatapplication/pdf
dc.identifier.doi10.1016/j.cor.2024.106873
dc.identifier.issn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/14109
dc.languagespa
dc.publisherCOMPUTERS AND OPERATIONS RESEARCH
dc.relation.uri10.1016/j.cor.2024.106873
dc.rightsPUBLICADA
dc.subjectSetup constraints
dc.subjectQuadratic knapsack problem
dc.subjectMatheuristic algorithms
dc.subjectLocal search
dc.titleTHE QUADRATIC KNAPSACK PROBLEM WITH SETUP
dc.typeARTÍCULO
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.SedeCONCEPCIÓN
Archivos
Colecciones
Artículos científicos