Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
From MaRDI portal
(Redirected from Publication:960412)
Recommendations
- Heuristics for the 0-1 multidimensional knapsack problem
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- scientific article; zbMATH DE number 1054949
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- scientific article; zbMATH DE number 1728442
- A procedure-based heuristic for 0-1 multiple knapsack problems
Cites work
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- A genetic algorithm for the multidimensional knapsack problem
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- An approximate dynamic programming approach to multidimensional knapsack problems
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Computationally manageable combinational auctions
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Exploiting nested inequalities and surrogate constraints
- Greedy algorithm for the general multidimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Partial enumeration in heuristics for some combinatorial optimization problems
- Some integer programs arising in the design of main frame computers
- The Theory and Computation of Knapsack Functions
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- The multidimensional 0-1 knapsack problem: an overview.
Cited in
(26)- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- scientific article; zbMATH DE number 1728442 (Why is no real title available?)
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- The multidimensional knapsack problem: structure and algorithms
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
- A randomized heuristic repair for the multidimensional knapsack problem
- Memory and learning in metaheuristics
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- A heuristic algorithm for resource allocation/reallocation problem
- Greedy algorithm for the general multidimensional knapsack problem
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- A procedure-based heuristic for 0-1 multiple knapsack problems
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- Heuristics for the 0-1 multidimensional knapsack problem
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- Robust efficiency measures for linear knapsack problem variants
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
This page was built for publication: Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960412)
