Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
From MaRDI portal
Publication:960412
DOI10.1016/j.cor.2008.03.003zbMath1179.90282OpenAlexW2015206115MaRDI QIDQ960412
Khalil S. Hindi, Krzysztof Fleszar
Publication date: 17 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.03.003
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items (8)
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ An iterated ``hyperplane exploration approach for the quadratic knapsack problem ⋮ 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 ⋮ A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem ⋮ Kernel search: a general heuristic for the multi-dimensional knapsack problem ⋮ Memory and Learning in Metaheuristics ⋮ Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Cites Work
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Exploiting nested inequalities and surrogate constraints
- A genetic algorithm for the multidimensional knapsack problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Improved results on the 0--1 multidimensional knapsack problem
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Greedy algorithm for the general multidimensional knapsack problem
- Computationally Manageable Combinational Auctions
- An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
- Some integer programs arising in the design of main frame computers
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- Partial enumeration in heuristics for some combinatorial optimization problems
- The Theory and Computation of Knapsack Functions
This page was built for publication: Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
