New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
From MaRDI portal
Publication:3885516
DOI10.1287/opre.27.6.1101zbMath0442.90058OpenAlexW2102428370MaRDI QIDQ3885516
Eleftherios Michaelides, Loulou, Richard
Publication date: 1979
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.27.6.1101
approximate solutionscomputational studycomparison of algorithmsmultidimensional 0-1 knapsack problemgreedy-like heuristics
Numerical mathematical programming methods (65K05) Specification and verification (program logics, model checking, etc.) (68Q60) Boolean programming (90C09)
Related Items
A class of practical interactive branch and bound algorithms for multicriteria integer programming, A multi-KP modeling for the maximum-clique problem, Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem, Dynamic tabu list management using the reverse elimination method, A simulated annealing approach to the multiconstraint zero-one knapsack problem, Surrogate duality in a branch-and-bound procedure for integer programming, Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions, 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, Optimal selection of energy efficiency measures for energy sustainability of existing buildings, The knapsack problem with generalized upper bounds, Heuristics and their design: A survey, Capacity allocation problem with random demands for the rail container carrier, Multicriteria dynamic programming with an application to the integer case, Modeling multiple plant sourcing decisions, An interactive dynamic programming approach to multicriteria discrete programming, The multidimensional 0-1 knapsack problem: an overview., Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem, Greedy algorithm for the general multidimensional knapsack problem, Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem, Algorithmic aspects for power-efficient hardware/software partitioning, Heuristic methods and applications: A categorized survey, Large-scale mixed integer programming: Benders-type heuristics, Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence, Zero-one integer programs with few contraints - lower bounding theory, Multicriteria integer programming: A (hybrid) dynamic programming recursive approach, Heuristics and reduction methods for multiple constraints 0-1 linear programming problems, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Zero-one integer programs with few constraints - Efficient branch and bound algorithms
