Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
type: Item
instance of: scholarly article
title: Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
zbMATH Open document ID: 1403.90514
author: Nir Halman
author: Hans Kellerer
author: V. A. Strusevich
published in: European Journal of Operational Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6902946
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: non-linear Boolean programming
zbMATH Keywords: geometric rounding
zbMATH Keywords: \(K\)-approximation sets and functions
zbMATH Keywords: FPTAS
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.04.013
OpenAlex ID: W2796556323
cites work: Minimization of half-products
cites work: Single-item dynamic lot-sizing problems: an updated survey
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: FPTAS for half-products minimization with scheduling applications
cites work: An FPTAS for minimizing the product of two non-negative linear cost functions
cites work: An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
cites work: Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
cites work: A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
cites work: Approximating the nonlinear newsvendor and single-item stochastic lot-sizing problems when data is given by an oracle
cites work: Analysis of bounds for a capacitated single-item lot-sizing problem
cites work: A nonlinear knapsack problem
cites work: Complexity and algorithms for nonlinear optimization problems
cites work: About strongly polynomial time algorithms for quadratic optimization over submodular constraints
cites work: Approximation Algorithms for Certain Scheduling Problems
cites work: Positive half-products and scheduling with controllable processing times
cites work: An efficient fully polynomial approximation scheme for the Subset-Sum problem.
cites work: A new fully polynomial time approximation scheme for the Knapsack problem
cites work: Improved dynamic programming in connection with an FPTAS for the knapsack problem
cites work: Q4821303
cites work: Approximability issues for unconstrained and constrained maximization of half-product related functions
cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
cites work: MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK
cites work: The symmetric quadratic knapsack problem: approximation and scheduling applications
cites work: Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
cites work: Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
cites work: Quadratic programming and combinatorial minimum weight product problems
cites work: Q3123417
cites work: Fast Approximation Algorithms for Knapsack Problems
cites work: An FPTAS for optimizing a class of low-rank functions over a polytope
cites work: Parallel Machine Scheduling: Impact of Adding Extra Machines
cites work: Combinatorial Problems: Reductibility and Approximation
cites work: Differential approximation schemes for half-product related functions and their scheduling applications
cites work: A survey on offline scheduling with rejection
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
cites work: A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
Wikidata QID: Q130037988
DOI: 10.1016/J.EJOR.2018.04.013
Recommended article: Approximating single- and multi-objective nonlinear sum and product knapsack problems
Recommended article: The approximability of non-Boolean satisfiability problems and restricted integer programming
Recommended article: On a discrete nonlinear and nonseparable knapsack problem
Recommended article: An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints
Recommended article: A unified method for a class of convex separable nonlinear knapsack problems
Recommended article: A Solution Strategy for a Class of Nonlinear Knapsack Problems
Recommended article: Approximation schemes for multiperiod binary knapsack problems
Recommended article: Approximation schemes for the parametric knapsack problem
Recommended article: Nonconvex piecewise linear knapsack problems
description: scientific article; zbMATH DE number 6902946