Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
From MaRDI portal
Publication:342188
DOI10.1016/J.COR.2015.08.002zbMATH Open1349.90720OpenAlexW2206877504MaRDI QIDQ342188FDOQ342188
Xianhao Xu, Jin Qin, Qinghua Wu, 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
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
- An exact algorithm for large multiple knapsack problems
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- Multi-neighborhood tabu search for the maximum weight clique problem
- Handbook of metaheuristics
- Exact methods for the knapsack problem and its generalizations
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- Balancing assembly lines with tabu search
- Exact Solution of the Quadratic Knapsack Problem
- The case for strategic oscillation
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- A tabu search algorithm for the multi-period inspector scheduling problem
- Memetic search for the max-bisection problem
- On classes of functions for which no free lunch results hold
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Strategic oscillation for the quadratic multiple knapsack problem
- The freight allocation problem with lane cost balancing constraint
- A dynamic tabu search for large-scale generalized assignment problems
Cited In (12)
- 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
- 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
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
Uses Software
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)
