A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
type: Item
instance of: scholarly article
title: A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
zbMATH Open document ID: 1244.90202
author: Zhou Xu
published in: European Journal of Operational Research
publication date: 2012-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6066855
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: quadratic knapsack
zbMATH Keywords: FPTAS
zbMATH Keywords: strongly polynomial time
zbMATH Keywords: machine scheduling
MaRDI profile type: Publication
full work available at URL: j.ejor.2011.10.049
OpenAlex ID: W2020203251
cites work: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
cites work: A single-item economic lot-sizing problem with a non-uniform resource: Approximation
cites work: Positive half-products and scheduling with controllable processing times
cites work: MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK
cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
cites work: Combinatorial optimization. Theory and algorithms.
cites work: A faster fully polynomial approximation scheme for the single-machine total tardiness problem
cites work: Improving the complexities of approximation algorithms for optimization problems
cites work: Capacitated two-parallel machines scheduling to minimize sum of job completion times
cites work: Batching and scheduling in a multi-machine flow shop
cites work: An FPTAS for a supply scheduling problem with non-monotone cost functions
cites work: A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
cites work: Q3525910
cites work: Preemptive scheduling with availability constraints to minimize total weighted completion times
DOI: 10.1016/J.EJOR.2011.10.049
description: scientific article; zbMATH DE number 6066855