QR-Code

An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients

Benchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range <i>R</i>, and these instances can be referred to as the unbounded knapsack problem with bounded coefficients (UKPB). In order to increase the difficulty of solv...

Ausführliche Beschreibung

Gespeichert in:
1. Verfasser: Yang Yang
Format: Artigo
Sprache:Inglês
Veröffentlicht: MDPI AG 2024-06-01
Schriftenreihe:Mathematics
Schlagworte:
unbounded knapsack problem with bounded coefficients
dynamic programming
branch and bound
linear Diophantine equation
Frobenius problem
all-capacities unbounded knapsack problem
Online-Zugang:https://www.mdpi.com/2227-7390/12/12/1878
Tags: Tag hinzufügen
Keine Tags, Fügen Sie das erste Tag hinzu!

Ähnliche Einträge