Pages that link to "Item:Q845859"
From MaRDI portal
The following pages link to An efficient approximation for the generalized assignment problem (Q845859):
Displayed 13 items.
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
- Distributed approximation of cellular coverage (Q433421) (← links)
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- The generalized maximum coverage problem (Q963466) (← links)
- Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258) (← links)
- Task assignment in tree-like hierarchical structures (Q2410113) (← links)
- Approximability of Two Variants of Multiple Knapsack Problems (Q2947034) (← links)
- Two stage decision making approach for Sensor Mission Assignment Problem (Q2954347) (← links)
- Tight Approximation Bounds for the Seminar Assignment Problem (Q2971167) (← links)
- A Polynomial Time Approximation Scheme for the Square Packing Problem (Q3503847) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
- A Novel Approximate Algorithm for Admission Control (Q5321723) (← links)