Pages that link to "Item:Q973008"

The following pages link to Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008):

Displaying 38 items.

• Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
• Semi-online scheduling on a single machine with unexpected breakdown (Q306274) (← links)
• Minimizing total weighted completion time with an unexpected machine unavailable interval (Q398911) (← links)
• Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
• A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504) (← links)
• Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629) (← links)
• Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300) (← links)
• Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
• Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
• Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
• Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
• An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• Solving 0-1 knapsack problems based on amoeboid organism algorithm (Q2016352) (← links)
• A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
• On the rectangular knapsack problem (Q2168057) (← links)
• Single machine scheduling with non-availability interval and optional job rejection (Q2168742) (← links)
• On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem (Q2216176) (← links)
• Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
• Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864) (← links)
• Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
• Scheduling with two competing agents to minimize total weighted earliness (Q2399317) (← links)
• Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance (Q2434334) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
• Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time (Q3004670) (← links)
• Dual Techniques for Scheduling on a Machine with Varying Speed (Q3174696) (← links)
• Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
• Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
• Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
• A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
• Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)