Heuristic algorithms for the multiple knapsack problem
From MaRDI portal
Cites work
Cited in
(58)- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- An linear programming based lower bound for the simple assembly line balancing problem
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
- A hybrid genetic algorithm for satellite image downlink scheduling problem
- The inverse-parametric knapsack problem
- Matroidal relaxations for 0-1 knapsack problems
- Truthful approximation mechanisms for restricted combinatorial auctions
- An investigation into two bin packing problems with ordering and orientation implications
- Shared capacity routing problem -- an omni-channel retail study
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine
- Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms
- Hybrid rounding techniques for knapsack problems
- The knapsack problem with generalized upper bounds
- Mathematical models and decomposition methods for the multiple knapsack problem
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Upper bounds and algorithms for the maximum cardinality bin packing problem.
- Hierarchical resource planning for shipping companies
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- Towards the real time solution of strike force asset allocation problems
- Adaptive memory programming for the vehicle routing problem with multiple trips
- Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
- Solving the generalised assignment problem using polyhedral results
- Value of agreement in decision analysis: concept, measures and application
- Solving efficiently the 0-1 multi-objective knapsack problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
- Optimal bounds for the change-making problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- Approximation algorithms for knapsack problems with cardinality constraints
- 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
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- New heuristics for one-dimensional bin-packing
- Random search in the one-dimensional cutting stock problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- The multidimensional 0-1 knapsack problem: an overview.
- Partial cover and complete cover inequalities
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Knowledge based approach to the cutting stock problem
- A revised bound improvement sequence algorithm
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
- Using fuzzy numbers in knapsack problems
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- Adjacency of the 0-1 knapsack problem
- Threshold arrangements and the knapsack problem
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- Configurable offers and winner determination in multi-attribute auctions
This page was built for publication: Heuristic algorithms for the multiple knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148788)
