Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem

DOI10.1016/J.COR.2015.08.002MaRDI QIDQ342188zbMATH OpenOpenAlexFDO

Authors Jin Qin, Qinghua Wu, Xianhao Xu, T. C. Edwin Cheng

Publication date 17 November 2016

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

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

zbMATH Keywords

tabu searchinfeasible local searchthe quadratic multiple knapsack problem

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27)

Recommendations

• Iterated responsive threshold search for the quadratic multiple knapsack problem
• A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
• An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem

Cites work

• A dynamic tabu search for large-scale generalized assignment problems
• A tabu search algorithm for the multi-period inspector scheduling problem
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• An exact algorithm for large multiple knapsack problems
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• Balancing assembly lines with tabu search
• Exact Solution of the Quadratic Knapsack Problem
• Exact methods for the knapsack problem and its generalizations
• Handbook of metaheuristics
• Memetic search for the max-bisection problem
• Multi-neighborhood tabu search for the maximum weight clique problem
• On classes of functions for which no free lunch results hold
• Strategic oscillation for the quadratic multiple knapsack problem
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
• The case for strategic oscillation
• The freight allocation problem with lane cost balancing constraint

Cited in

(16)

• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
• Learning-based multi-objective evolutionary algorithm for batching decision problem
• 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
• Learning-driven feasible and infeasible tabu search for airport gate assignment
• 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
• Solving generalized polynomial problem by using new affine relaxed technique
• An ejection chain approach for the quadratic multiple knapsack problem
• Frequent pattern mining driven evolutionary search for cross-dock door assignment
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment
• Iterated responsive threshold search for the quadratic multiple knapsack problem
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem

Describes a project that uses

Uses Software

• MULKNAP
• Knapsack

This page was built for publication: Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem

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