Pages that link to "Item:Q1866996"
From MaRDI portal
The following pages link to Approximation algorithms for fractional knapsack problems (Q1866996):
Displaying 6 items.
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Capacitated assortment and price optimization for customers with disjoint consideration sets (Q1728178) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930) (← links)
- Approximating a class of combinatorial problems with rational objective function (Q2638374) (← links)
- A sixth bibliography of fractional programming (Q3426331) (← links)
