New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
From MaRDI portal
Cited in
(31)- Algorithmic aspects for power-efficient hardware/software partitioning
- Zero-one integer programs with few contraints - lower bounding theory
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Surrogate duality in a branch-and-bound procedure for integer programming
- A computational evaluation of optimal solution value estimation procedures
- Aggregation of constraints in integer programming
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- The knapsack problem with generalized upper bounds
- Heuristics and their design: A survey
- Multicriteria dynamic programming with an application to the integer case
- An interactive dynamic programming approach to multicriteria discrete programming
- A multi-KP modeling for the maximum-clique problem
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- Heuristic methods and applications: A categorized survey
- Dynamic tabu list management using the reverse elimination method
- Greedy algorithm for the general multidimensional knapsack problem
- Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence
- Optimal selection of energy efficiency measures for energy sustainability of existing buildings
- Modeling multiple plant sourcing decisions
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Capacity allocation problem with random demands for the rail container carrier
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- Large-scale mixed integer programming: Benders-type heuristics
- Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
This page was built for publication: New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885516)
