The following pages link to The Multiple Subset Sum Problem (Q2706330):
Displaying 19 items.
- Approximate core allocations and integrality gap for the bin packing game (Q265072) (← links)
- Approximate composable truthful mechanism design (Q344791) (← links)
- An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
- Notes on inverse bin-packing problems (Q458387) (← 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)
- \(\kappa\)-partitioning problems for maximizing the minimum load (Q1879573) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Lower and upper bounds for the non-linear generalized assignment problem (Q2664280) (← links)
- A Fast Approximation Scheme for the Multiple Knapsack Problem (Q2891378) (← 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)
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401) (← links)
- Lens Spaces, Isospectral on Forms but not on Functions (Q3430828) (← 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)
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms (Q6136082) (← links)
