Pages that link to "Item:Q2494823"

The following pages link to A \((1-1/e)\)-approximation algorithm for the generalized assignment problem (Q2494823):

Displayed 13 items.

• An efficient approximation for the generalized assignment problem (Q845859) ‎ (← links)
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) ‎ (← links)
• Scheduling jobs with sizes and delivery times on identical parallel batch machines (Q2202014) ‎ (← 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)
• Packing items into several bins facilitates approximating the separable assignment problem (Q2345851) ‎ (← links)
• Approximation algorithms for the generalized incremental knapsack problem (Q2687039) ‎ (← links)
• Approximability of Two Variants of Multiple Knapsack Problems (Q2947034) ‎ (← links)
• Min Sum Edge Coloring in Multigraphs Via Configuration LP (Q3503859) ‎ (← links)
• Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays (Q5106360) ‎ (← links)
• Multiple subset sum with inclusive assignment set restrictions (Q5300451) ‎ (← links)
• The Complexity of Contracts (Q5856150) ‎ (← links)
• A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) ‎ (← links)