Pages that link to "Item:Q1319018"
From MaRDI portal
The following pages link to An approximation algorithm for the generalized assignment problem (Q1319018):
Displayed 36 items.
- The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem (Q2494823) (← links)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- An ejection chain approach for the generalized assignment problem (Q2573015) (← links)
- On some special cases of the restricted assignment problem (Q2630343) (← links)
- Lower and upper bounds for the non-linear generalized assignment problem (Q2664280) (← links)
- Approximation algorithms for the generalized incremental knapsack problem (Q2687039) (← links)
- Efficient time-stepping techniques for simulating turbulent reactive flows with stiff chemistry (Q2696495) (← links)
- Task swapping networks in distributed systems (Q2874305) (← links)
- Approximability of Two Variants of Multiple Knapsack Problems (Q2947034) (← links)
- Tight Approximation Bounds for the Seminar Assignment Problem (Q2971167) (← links)
- APPLICATION PLACEMENT ON A CLUSTER OF SERVERS (Q3065615) (← links)
- A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates (Q3102810) (← links)
- Minimum-Cost Single-Source 2-Splittable Flow (Q3439153) (← links)
- Energy-Efficient Algorithms for Non-preemptive Speed-Scaling (Q3453287) (← links)
- A Family of Scheduling Algorithms for Hybrid Parallel Platforms (Q4639930) (← links)
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931) (← links)
- On dependent randomized rounding algorithms (Q4645933) (← links)
- Stochastic Load Balancing on Unrelated Machines (Q4991668) (← links)
- Simpler and Better Algorithms for Minimum-Norm Load Balancing (Q5075764) (← links)
- (Q5075815) (← links)
- (Q5075832) (← links)
- Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays (Q5106360) (← links)
- Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit (Q5223044) (← links)
- Truthful Generalized Assignments via Stable Matching (Q5244865) (← links)
- Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
- Multiple subset sum with inclusive assignment set restrictions (Q5300451) (← links)
- Improved Lower Bounds for Non-utilitarian Truthfulness (Q5443369) (← links)
- (Q5743409) (← links)
- A PTAS for Scheduling Unrelated Machines of Few Different Types (Q5895057) (← links)
- Robustly assigning unstable items (Q5918516) (← links)
- EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
- Configuration balancing for stochastic requests (Q6085995) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
- Reallocation problems with minimum completion time (Q6113854) (← links)