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
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
combinatorial optimizationF-MSGGeneralized Quadratic Multiple Knapsack Problem (G-QMKP)Genetic Algorithm (GA)production with plastic injection
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- The quadratic knapsack problem -- a survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quadratic knapsack problems
- New trends in exact algorithms for the \(0-1\) knapsack problem
- A computational study on the quadratic knapsack problem with multiple constraints
- Exact Solution of the Quadratic Knapsack Problem
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Knapsack problems with setups
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- 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
- The performance of the modified subgradient algorithm on solving the 0-1 quadratic Knapsack problem
- Optimization of Performance of Genetic Algorithm for 0-1 Knapsack Problems Using Taguchi Method
- Title not available (Why is that?)
- The modified subgradient algorithm based on feasible values
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem
Cited In (9)
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
- 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
- A branch-and-bound algorithm for the quadratic multiple knapsack problem
- Polynomial-size formulations and relaxations for the 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
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
Uses Software
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)
