A PTAS for a class of binary non-linear programs with low-rank functions
type: Item
instance of: scholarly article
title: A PTAS for a class of binary non-linear programs with low-rank functions
author: Trung Thanh Nguyen
author: Khaled Elbassioni
published in: Operations Research Letters
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 7442903
zbMATH Keywords: binary non-linear program
zbMATH Keywords: convex program
zbMATH Keywords: low-rank function
zbMATH Keywords: polynomial-time approximation scheme
MaRDI profile type: Publication
full work available at URL: j.orl.2021.06.017
OpenAlex ID: W3180342608
cites work: Polymatroids and mean-risk minimization in discrete optimization
cites work: Q4252723
cites work: Approximating a class of combinatorial problems with rational objective function
cites work: Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank
cites work: Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
cites work: Approximation schemes for \(r\)-weighted minimization knapsack problems
cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
cites work: An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
cites work: Geometric algorithms and combinatorial optimization
cites work: Semidefinite representation of convex sets
cites work: Q5630793
cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
cites work: The symmetric quadratic knapsack problem: approximation and scheduling applications
cites work: Packing Under Convex Quadratic Constraints
cites work: Q4109494
cites work: There is no EPTAS for two-dimensional knapsack
cites work: A review of piecewise linearization methods
cites work: A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
cites work: An FPTAS for optimizing a class of low-rank functions over a polytope
cites work: The quadratic 0-1 knapsack problem with series-parallel support
cites work: A PTAS for capacitated sum-of-ratios optimization
cites work: Fractional programming: The sum-of-ratios case
cites work: Q3818127
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
DOI: 10.1016/J.ORL.2021.06.017
description: scientific article; zbMATH DE number 7442903