Pages that link to "Item:Q5470710"
From MaRDI portal
The following pages link to A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (Q5470710):
Displaying 39 items.
- A Fast Approximation Scheme for the Multiple Knapsack Problem (Q2891378) (← links)
- A deterministic polynomial-time approximation scheme for counting knapsack solutions (Q2903521) (← links)
- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint (Q3512451) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- (Q3678961) (← links)
- A Note on Approximation Schemes for Multidimensional Knapsack Problems (Q3718485) (← links)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
- (Q4400850) (← links)
- A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem (Q4558310) (← links)
- Packing groups of items into multiple knapsacks (Q4601880) (← links)
- Packing Groups of Items into Multiple Knapsacks (Q4629965) (← links)
- (Q4636439) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- Ranking with Fairness Constraints (Q5002698) (← links)
- (Q5075815) (← links)
- A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems (Q5080670) (← links)
- Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays (Q5106360) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit (Q5223044) (← links)
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version (Q5240422) (← links)
- Truthful Generalized Assignments via Stable Matching (Q5244865) (← links)
- Multiple subset sum with inclusive assignment set restrictions (Q5300451) (← links)
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem (Q5874514) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Approximation algorithms for scheduling with reservations (Q5961975) (← links)
- (Q6065401) (← links)
- Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs (Q6078291) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913) (← links)
- A distributed game theoretical approach for credibility-guaranteed multimedia data offloading in MEC (Q6492076) (← links)
- Approximations for Throughput Maximization (Q6492088) (← links)
- Approximation algorithms for the MAXSPACE advertisement problem (Q6580082) (← links)
- Scheduling and packing under uncertainty (Q6606619) (← links)
- Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems (Q6633554) (← links)
- Improved approximation for two-dimensional vector multiple knapsack (Q6639376) (← links)
- Time-sharing scheduling with tolerance capacities (Q6655677) (← links)
- Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time (Q6657418) (← links)
- Local-search based heuristics for advertisement scheduling (Q6658437) (← links)