Pages that link to "Item:Q1319018"

The following pages link to An approximation algorithm for the generalized assignment problem (Q1319018):

Displaying 50 items.

• The generalized assignment problem with minimum quantities (Q257215) (← links)
• Generalized fuzzy assignment problem with restriction on the cost of job under hesitant fuzzy environment (Q260612) (← links)
• Vertex cover meets scheduling (Q270025) (← links)
• Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
• New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
• A survey on offline scheduling with rejection (Q398830) (← links)
• A 3/2-approximation algorithm for \(k_i\)-partitioning (Q408403) (← links)
• Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
• The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
• Distributed approximation of cellular coverage (Q433421) (← links)
• Two heuristic solution concepts for the vehicle selection problem in line haul transports (Q439400) (← links)
• Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
• Assigning sporadic tasks to unrelated machines (Q494326) (← links)
• Truthful mechanism design via correlated tree rounding (Q526848) (← links)
• Improved lower bounds for non-utilitarian truthfulness (Q627119) (← links)
• Assigning real-time tasks to heterogeneous processors by applying ant colony optimization (Q635307) (← links)
• LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
• Approximation algorithms for time constrained scheduling (Q676776) (← links)
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection (Q681293) (← links)
• Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
• On a pair of job-machine assignment problems with two stages (Q732901) (← links)
• Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046) (← links)
• Scheduling MapReduce jobs on identical and unrelated processors (Q778521) (← links)
• Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
• An efficient approximation for the generalized assignment problem (Q845859) (← links)
• Machine scheduling with resource dependent processing times (Q877194) (← links)
• Scheduling and fixed-parameter tractability (Q896271) (← links)
• 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)
• The generalized assignment problem: Valid inequalities and facets (Q909579) (← 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)
• R \& D planning and the generalized assignment problem (Q1112722) (← links)
• Scheduling unit-time jobs on processors with different capabilities (Q1121780) (← links)
• On dependent randomized rounding algorithms (Q1306458) (← links)
• An approximation algorithm for the license and shift class design problem (Q1328603) (← links)
• Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
• A simple dual algorithm for the generalised assignment problem (Q1365112) (← links)
• The \(\beta\)-assignment problem in general graphs (Q1370666) (← links)
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
• A note on exact algorithms for the bottleneck generalized assignment problem (Q1388862) (← links)
• On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)