Publication | Closed Access

Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications

Mathematical ProgrammingEngineeringScheduling ProblemOptimization ProblemScheduling ApplicationsDiscrete OptimizationComputational ComplexityPolynomial Approximation SchemesDiscrete MathematicsLinear ProgrammingCombinatorial OptimizationKnapsack ProblemApproximation TheoryQuadratic ProgrammingOperations Research