Pages that link to "Item:Q1402509"
From MaRDI portal
The following pages link to A 3/4-approximation algorithm for multiple subset sum (Q1402509):
Displayed 14 items.
- Approximate core allocations and integrality gap for the bin packing game (Q265072) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- Coordinated lab-clinics: a tactical assignment problem in healthcare (Q1695040) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- Integrality gap analysis for bin packing games (Q1758278) (← links)
- Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345) (← links)
- Coupled-Tasks in Presence of Bipartite Compatibilities Graphs (Q3195325) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- Multiple subset sum with inclusive assignment set restrictions (Q5300451) (← links)
- Approximation algorithms for scheduling with reservations (Q5961975) (← links)
- Faster algorithms for \(k\)-\textsc{Subset Sum} and variations (Q6113909) (← links)