An iterated ``hyperplane exploration approach for the quadratic knapsack problem

DOI10.1016/j.cor.2016.08.006zbMath1391.90507OpenAlexW2512265885MaRDI QIDQ1652040

Jin-Kao Hao, Yuning Chen

Publication date: 11 July 2018

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

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

zbMATH Keywords

heuristicstabu searchquadratic knapsack problemvariable fixinghyperplane exploration

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (8)

Dual mean field search for large scale linear and quadratic knapsack problems ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ Dual mean field annealing scheme for binary optimization under linear constraints ⋮ A lifted-space dynamic programming algorithm for the quadratic knapsack problem ⋮ Responsive strategic oscillation for solving the disjunctively constrained knapsack problem ⋮ A hybrid evolutionary search for the generalized quadratic multiple knapsack problem ⋮ Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem

Uses Software

• Knapsack
• SPOT
• irace
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
• Improved bounds for large scale capacitated arc routing problem
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
• An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
• The case for strategic oscillation
• Diversification-driven tabu search for unconstrained binary quadratic problems
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• The quadratic knapsack problem -- a survey
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
• Linear programming for the \(0-1\) quadratic knapsack problem
• An extended formulation approach to the edge-weighted maximal clique problem
• A cutting-plane approach to the edge-weighted maximal clique problem
• Min-cut clustering
• A semidefinite programming approach to the quadratic knapsack problem
• Greedy randomized adaptive search procedures
• Dynamic tabu list management using the reverse elimination method
• New convergent heuristics for 0-1 mixed integer programming
• Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
• Quadratic knapsack problems
• Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
• Exact Solution of the Quadratic Knapsack Problem

This page was built for publication: An iterated ``hyperplane exploration approach for the quadratic knapsack problem