The performance of the modified subgradient algorithm on solving the 0-1 quadratic Knapsack problem

MaRDI QIDQ3395302zbMATH OpenFDO

Authors Aydin Sipahioglu, Tugba Saraç

Publication date 25 August 2009

zbMATH Keywords

sharp augmented Lagrangian function

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
• The modified subgradient algorithm based on feasible values
• Solving the quadratic assignment problem using F-MSG algorithm
• Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
• Efficient Methods For Solving Quadratic 0–1 Knapsack Problems

Cited in

(7)

• A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
• Bipenalty method from a frequency domain perspective
• A genetic algorithm for optimization of a relational knapsack problem with respect to a description logic knowledge base
• Dual mean field search for large scale linear and quadratic knapsack problems
• Generalized quadratic multiple knapsack problem and two solution approaches
• The modified subgradient algorithm based on feasible values
• Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem

Describes a project that uses

Uses Software

• GAMS
• Knapsack

This page was built for publication: The performance of the modified subgradient algorithm on solving the 0-1 quadratic Knapsack problem

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