Heuristic algorithms for the multiple knapsack problem
From MaRDI portal
Publication:1148788
DOI10.1007/BF02243544zbMath0452.90047OpenAlexW2922809901MaRDI QIDQ1148788
Publication date: 1981
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02243544
heuristic algorithmsimplementationcomputational experiencerandom test problemssuboptimal solutionslarge size problemsmultiple knapsack problem
Related Items
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Partial cover and complete cover inequalities, Shared capacity routing problem -- an omni-channel retail study, Configurable offers and winner determination in multi-attribute auctions, A Branch-and-Price Algorithm for the Multiple Knapsack Problem, Adaptive memory programming for the vehicle routing problem with multiple trips, A revised bound improvement sequence algorithm, Value of agreement in decision analysis: concept, measures and application, Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts, BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, A binary multiple knapsack model for single machine scheduling with machine unavailability, An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks, The knapsack problem with generalized upper bounds, Online knapsack of unknown capacity. How to optimize energy consumption in smartphones, Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations, An approximation algorithm for solving unconstrained two-dimensional knapsack problems, A new iterative-doubling greedy-lookahead algorithm for the single container loading problem, The inverse-parametric knapsack problem, Hierarchical resource planning for shipping companies, Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs, Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs, Upper bounds and algorithms for the maximum cardinality bin packing problem., An investigation into two bin packing problems with ordering and orientation implications, Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem, A multi-phase constructive heuristic for the vehicle routing problem with multiple trips., The multidimensional 0-1 knapsack problem: an overview., A hybrid genetic algorithm for satellite image downlink scheduling problem, An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms, A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, Solving efficiently the 0-1 multi-objective knapsack problem, Adjacency of the 0-1 knapsack problem, Knowledge based approach to the cutting stock problem, Mathematical models and decomposition methods for the multiple knapsack problem, Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method, A multi-level search strategy for the 0-1 multidimensional knapsack problem, Towards the real time solution of strike force asset allocation problems, Hybrid rounding techniques for knapsack problems, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, Using fuzzy numbers in knapsack problems, New heuristics for one-dimensional bin-packing, Truthful approximation mechanisms for restricted combinatorial auctions, Implementing an efficient fptas for the 0-1 multi-objective knapsack problem, Random search in the one-dimensional cutting stock problem, Approximation algorithms for knapsack problems with cardinality constraints, New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems, Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms, Solving the generalised assignment problem using polyhedral results, Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems, An linear programming based lower bound for the simple assembly line balancing problem, Iterated responsive threshold search for the quadratic multiple knapsack problem, Optimal bounds for the change-making problem, The total completion time open shop scheduling problem with a given sequence of jobs on one machine, A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective, Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems, Matroidal relaxations for 0-1 knapsack problems, Threshold arrangements and the knapsack problem, A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Uses Software
Cites Work
