Pages that link to "Item:Q1319018"
From MaRDI portal
The following pages link to An approximation algorithm for the generalized assignment problem (Q1319018):
Displaying 50 items.
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Coupled and \(k\)-sided placements: generalizing generalized assignment (Q896299) (← links)
- Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
- Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
- The generalized maximum coverage problem (Q963466) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- Bandwidth-constrained allocation in grid computing (Q1018048) (← links)
- Geometric quadrisection in linear time, with application to VLSI placement (Q1019299) (← links)
- Matrix columns allocation problems (Q1019735) (← links)
- Scheduling jobs with time-resource tradeoff via nonlinear programming (Q1040086) (← links)
- Minimum-cost single-source 2-splittable flow (Q1041715) (← links)
- On dependent randomized rounding algorithms (Q1306458) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- Truthfulness in advertising? Approximation mechanisms for knapsack bidders (Q1651735) (← links)
- Generalized assignment problem: truthful mechanism design without money (Q1727952) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Estimating the makespan of the two-valued restricted assignment problem (Q1751100) (← links)
- Flexible allocation on related machines with assignment restrictions (Q1801074) (← links)
- Priority algorithms for makespan minimization in the subset model. (Q1853127) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962) (← links)
- Assigning papers to referees (Q1959732) (← links)
- Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
- Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
- Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
- Preclustering algorithms for imprecise points (Q2144264) (← links)
- Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- Scheduling jobs with sizes and delivery times on identical parallel batch machines (Q2202014) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
- Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
- On the approximability of the two-phase knapsack problem (Q2279756) (← links)
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors (Q2281614) (← 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)
- Packing items into several bins facilitates approximating the separable assignment problem (Q2345851) (← links)
- Data migration on parallel disks: Algorithms and evaluation (Q2369881) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- Approximation algorithms for the graph balancing problem with two speeds and two job lengths (Q2424664) (← links)
- Maximizing throughput in queueing networks with limited flexibility (Q2426560) (← links)
- Improved approximation algorithms for data migration (Q2429330) (← links)
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571) (← links)
- Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
- Best compromise solution for a new multiobjective scheduling problem (Q2489291) (← links)