Pages that link to "Item:Q845859"

The following pages link to An efficient approximation for the generalized assignment problem (Q845859):

Displaying 26 items.

• The generalized assignment problem with minimum quantities (Q257215) (← links)
• The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
• Distributed approximation of cellular coverage (Q433421) (← links)
• Improved approximation algorithms for box contact representations (Q521820) (← links)
• Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
• The generalized maximum coverage problem (Q963466) (← links)
• Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
• Flexible allocation on related machines with assignment restrictions (Q1801074) (← links)
• Solving the weighted capacitated planned maintenance problem and its variants (Q1991204) (← links)
• Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
• A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
• A priority based unbalanced time minimization assignment problem (Q2307977) (← links)
• Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) (Q2326400) (← links)
• A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
• Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← links)
• Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258) (← links)
• Task assignment in tree-like hierarchical structures (Q2410113) (← links)
• On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
• Approximation algorithms for the generalized incremental knapsack problem (Q2687039) (← links)
• Approximability of Two Variants of Multiple Knapsack Problems (Q2947034) (← links)
• Two stage decision making approach for Sensor Mission Assignment Problem (Q2954347) (← links)
• Tight Approximation Bounds for the Seminar Assignment Problem (Q2971167) (← links)
• A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← 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)
• A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)