Pages that link to "Item:Q4149230"
From MaRDI portal
The following pages link to An algorithm for the 0/1 Knapsack problem (Q4149230):
Displaying 5 items.
- A fully polynomial approximation algorithm for the 0-1 knapsack problem (Q1159134) (← links)
- Probabilistic analysis of the subset-sum problem (Q1168896) (← links)
- A language and a program for stating and solving combinatorial problems (Q1245009) (← links)
- Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben (Q3804451) (← links)
- An improved enumeration for pure 0-1 programs (Q3978584) (← links)
