Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method

DOI10.1016/j.cor.2011.10.016zbMath1251.90330OpenAlexW2064214464MaRDI QIDQ1761134

Huan-Fu Chang, Vincent C. Li, Yun-Chia Liang

Publication date: 15 November 2012

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

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

zbMATH Keywords

heuristicsmultidimensional knapsackgeneralized upper boundadaptive memory projectioncritical event tabu search

Mathematics Subject Classification ID

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

Related Items (3)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models

Uses Software

• CPLEX
• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
• A heuristic algorithm for the multidimensional zero-one knapsack problem
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• A column generation method for the multiple-choice multi-dimensional knapsack problem
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• Heuristic algorithms for the multiple knapsack problem
• The 0-1 knapsack problem with multiple choice constraints
• A genetic algorithm for the multidimensional knapsack problem
• A note on hashing functions and tabu search algorithms
• Local branching
• The multidimensional 0-1 knapsack problem: an overview.
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
• Towards the real time solution of strike force asset allocation problems
• Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
• New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• Combinatorial Auctions: A Survey
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• The Multiple-Choice Knapsack Problem
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• The Theory and Computation of Knapsack Functions

This page was built for publication: Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method