Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints

DOI10.1016/j.cor.2004.04.020zbMath1071.90051OpenAlexW2082487060MaRDI QIDQ1781556

Vincent C. Li

Publication date: 27 June 2005

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

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

zbMATH Keywords

Tabu searchMultidimensional knapsackStrategic oscillationGeneralized upper boundMultidimensional multiple-choice knapsack

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A Modified Binary Particle Swarm Optimization for Knapsack Problems ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
• A genetic algorithm for the multidimensional knapsack problem
• Tutorial on surrogate constraint approaches for optimization in graphs
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Towards the real time solution of strike force asset allocation problems
• An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories

This page was built for publication: Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints