Generalized quadratic multiple knapsack problem and two solution approaches

DOI10.1016/J.COR.2013.08.018zbMATH Open1348.90555OpenAlexW2002891875MaRDI QIDQ336889FDOQ336889

Authors Tugba Saraç, Aydin Sipahioglu 

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2013.08.018

zbMATH Keywords

combinatorial optimizationF-MSGGeneralized Quadratic Multiple Knapsack Problem (G-QMKP)Genetic Algorithm (GA)production with plastic injection

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
• A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
• Lagrangian matheuristics for the quadratic multiple knapsack problem
• A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
• A branch-and-bound algorithm for the quadratic multiple knapsack problem

Cites work

• scientific article; zbMATH DE number 4112385 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A computational study on the quadratic knapsack problem with multiple constraints
• A cross entropy algorithm for the Knapsack problem with setups
• A variable-grouping based genetic algorithm for large-scale integer programming
• Algorithms for the bounded set-up knapsack problem
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
• Exact Solution of the Quadratic Knapsack Problem
• Exact and heuristic solution approaches for the mixed integer setup knapsack problem
• Knapsack problems with setups
• Lagrangean methods for the 0-1 quadratic knapsack problem
• Linear programming for the \(0-1\) quadratic knapsack problem
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Optimization of Performance of Genetic Algorithm for 0-1 Knapsack Problems Using Taguchi Method
• Quadratic knapsack problems
• Solving the quadratic assignment problem using F-MSG algorithm
• The modified subgradient algorithm based on feasible values
• The performance of the modified subgradient algorithm on solving the 0-1 quadratic Knapsack problem
• The quadratic knapsack problem -- a survey

Cited in

(9)

• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
• A branch-and-bound algorithm for the quadratic multiple knapsack problem
• A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
• Lagrangian matheuristics for the quadratic multiple knapsack problem
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
• A matheuristic for the 0--1 generalized quadratic multiple knapsack problem

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Generalized quadratic multiple knapsack problem and two solution approaches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336889)