Pages that link to "Item:Q1607031"
From MaRDI portal
The following pages link to A PTAS for the multiple subset sum problem with different knapsack capacities (Q1607031):
Displaying 17 items.
- Improved algorithmic results for unsplittable stable allocation problems (Q326457) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- LP based heuristics for the multiple knapsack problem with assignment restrictions (Q863573) (← links)
- A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← 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)
- The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
- The multiple subset sum problem (Q2706330) (← 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)
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS (Q3397506) (← 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)
