A Branch-and-Bound Algorithm for the Quadratic Multiple Knapsack Problem

2021 ◽  
Author(s):  
Krzysztof Fleszar
Keyword(s):  
Branch And Bound ◽  
Knapsack Problem ◽  
Branch And Bound Algorithm ◽  
Multiple Knapsack Problem ◽  
Multiple Knapsack

scholarly journals A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts

2021 ◽  
Vol 289 (2) ◽  
pp. 435-455
Author(s):  
Stefano Coniglio ◽  
Fabio Furini ◽  
Pablo San Segundo
Keyword(s):  
Branch And Bound ◽  
Knapsack Problem ◽  
Branch And Bound Algorithm

Ant Colony Optimization and Multiple Knapsack Problem

2007 ◽  
pp. 498-509 ◽  
Author(s):  
S. Fidanova
Keyword(s):  
Combinatorial Optimization ◽  
Ant Colony Optimization ◽  
Knapsack Problem ◽  
Optimization Problem ◽  
Combinatorial Optimization Problem ◽  
Ant Colony ◽  
Multiple Knapsack Problem ◽  
Constraint Problem ◽  
Multiple Knapsack ◽  
Ant Colony Optimization Algorithms

The ant colony optimization algorithms and their applications on the multiple knapsack problem (MKP) are introduced. The MKP is a hard combinatorial optimization problem with wide application. Problems from different industrial fields can be interpreted as a knapsack problem including financial and other management. The MKP is represented by a graph, and solutions are represented by paths through the graph. Two pheromone models are compared: pheromone on nodes and pheromone on arcs of the graph. The MKP is a constraint problem which provides possibilities to use varied heuristic information. The purpose of the chapter is to compare a variety of heuristic and pheromone models and different variants of ACO algorithms on MKP.

The Online Multiple Knapsack Problem

2018 ◽  
Author(s):  
Shashank Goyal ◽  
Diwakar Gupta
Keyword(s):  
Knapsack Problem ◽  
Multiple Knapsack Problem ◽  
Multiple Knapsack
Sign in / Sign up

Export Citation Format

Share Document