The following pages link to (Q4952619):
Displaying 31 items.
- Distributed approximation of cellular coverage (Q433421) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- Scheduling with bully selfish jobs (Q692928) (← links)
- The subset assignment problem for data placement in caches (Q724230) (← links)
- Packing resizable items with application to video delivery over wireless networks (Q742419) (← links)
- Approximation schemes for knapsack problems with shelf divisions (Q818116) (← links)
- An efficient approximation for the generalized assignment problem (Q845859) (← links)
- Coupled and \(k\)-sided placements: generalizing generalized assignment (Q896299) (← links)
- A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983) (← links)
- Bandwidth-constrained allocation in grid computing (Q1018048) (← links)
- Geometric quadrisection in linear time, with application to VLSI placement (Q1019299) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594) (← links)
- A PTAS for the time-invariant incremental knapsack problem (Q1661876) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- Multistage knapsack (Q2119404) (← links)
- Scheduling jobs with sizes and delivery times on identical parallel batch machines (Q2202014) (← links)
- Improved approximation algorithms for a bilevel knapsack problem (Q2354770) (← links)
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem (Q2494823) (← links)
- A new upper bound for the multiple knapsack problem (Q2668625) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Spectrum Bidding in Wireless Networks and Related (Q3511367) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
- Robustly assigning unstable items (Q5918516) (← links)
- Approximation algorithms for drone delivery scheduling with a fixed number of drones (Q6122609) (← links)
- A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)
