Pages that link to "Item:Q1683061"
From MaRDI portal
The following pages link to An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061):
Displaying 6 items.
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
