Pages that link to "Item:Q489742"
From MaRDI portal
The following pages link to Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable (Q489742):
Displaying 4 items.
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445) (← links)
- (Q5240419) (← links)