Pages that link to "Item:Q5101408"
From MaRDI portal
The following pages link to A minimal algorithm for the Bounded Knapsack Problem (Q5101408):
Displaying 8 items.
- A heuristic for the problem of one-dimensional steel coil cutting (Q1983859) (← links)
- A well-solvable special case of the bounded knapsack problem (Q2275577) (← links)
- The knapsack problem with a minimum filling constraint (Q3120586) (← links)
- Supercomputer Scheduling with Combined Evolutionary Techniques (Q3603111) (← links)
- A Minimal Algorithm for the 0-1 Knapsack Problem (Q4393123) (← links)
- A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517) (← links)
- Linear Time Algorithms for Knapsack Problems with Bounded Weights (Q4939603) (← links)
- A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH (Q5267564) (← links)