scientific article; zbMATH DE number 1445306
From MaRDI portal
Publication:4952619
zbMath0952.90020MaRDI QIDQ4952619
Chandra Chekuri, Sanjeev Khanna
Publication date: 15 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
Approximation schemes for knapsack problems with shelf divisions ⋮ Polynomial time approximation schemes for class-constrained packing problems ⋮ An efficient approximation for the generalized assignment problem ⋮ A Basic Parameterized Complexity Primer ⋮ A new upper bound for the multiple knapsack problem ⋮ Coupled and \(k\)-sided placements: generalizing generalized assignment ⋮ Upper bounds and algorithms for the maximum cardinality bin packing problem. ⋮ Approximation algorithms for drone delivery scheduling with a fixed number of drones ⋮ Spectrum Bidding in Wireless Networks and Related ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ Scheduling jobs with sizes and delivery times on identical parallel batch machines ⋮ Distributed approximation of cellular coverage ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ Confronting intractability via parameters ⋮ Improved approximation algorithms for box contact representations ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ Scheduling with bully selfish jobs ⋮ A branch-and-bound algorithm for hard multiple knapsack problems ⋮ A \((1-1/e)\)-approximation algorithm for the generalized assignment problem ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ The subset assignment problem for data placement in caches ⋮ Robustly assigning unstable items ⋮ Packing resizable items with application to video delivery over wireless networks ⋮ Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems ⋮ Bandwidth-constrained allocation in grid computing ⋮ Geometric quadrisection in linear time, with application to VLSI placement ⋮ Improved approximation algorithms for a bilevel knapsack problem
This page was built for publication:
