Generalized quadratic multiple knapsack problem and two solution approaches

DOI10.1016/j.cor.2013.08.018zbMath1348.90555OpenAlexW2002891875MaRDI QIDQ336889

Aydin Sipahioglu, Tugba Saraç

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)

Related Items (9)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem ⋮ Lagrangian matheuristics for the quadratic multiple knapsack problem ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ A hybrid evolutionary search for the generalized quadratic multiple knapsack problem ⋮ Polynomial-size formulations and relaxations 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

Uses Software

• Knapsack

Cites Work

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

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