Pages that link to "Item:Q1936656"

The following pages link to The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656):

Displaying 7 items.

• Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707) (← links)
• Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← 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)
• Single machine scheduling with a generalized job-dependent cumulative effect (Q1702657) (← links)
• Surveys in operations research (Q1730527) (← links)