Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 00:30, 14 September 2024

scientific article

Language	Label	Description	Also known as
English	Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints	scientific article

Statements

scholarly article

0 references

Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (English)

0 references

0 references

0 references

Vitaly A. Strusevich

0 references

European Journal of Operational Research

0 references

publication date

12 July 2018

0 references

zbMATH Keywords

combinatorial optimization

0 references

non-linear Boolean programming

0 references

geometric rounding

0 references

\(K\)-approximation sets and functions

0 references

FPTAS

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2018.04.013

0 references

Minimization of Half-Products

0 references

Single-item dynamic lot-sizing problems: an updated survey

0 references

An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure

0 references

A single-item economic lot-sizing problem with a non-uniform resource: Approximation

0 references

FPTAS for half-products minimization with scheduling applications

0 references

An FPTAS for minimizing the product of two non-negative linear cost functions

0 references

An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set

0 references

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs

0 references

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

0 references

Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle

0 references

Analysis of bounds for a capacitated single-item lot-sizing problem

0 references

A nonlinear knapsack problem

0 references

Complexity and algorithms for nonlinear optimization problems

0 references

About strongly polynomial time algorithms for quadratic optimization over submodular constraints

0 references

Approximation Algorithms for Certain Scheduling Problems

0 references

Positive half-products and scheduling with controllable processing times

0 references

An efficient fully polynomial approximation scheme for the Subset-Sum problem.

0 references

A new fully polynomial time approximation scheme for the Knapsack problem

0 references

Improved dynamic programming in connection with an FPTAS for the knapsack problem

0 references

0 references

Approximability issues for unconstrained and constrained maximization of half-product related functions

0 references

Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications

0 references

MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK

0 references

The symmetric quadratic knapsack problem: approximation and scheduling applications

0 references

Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product

0 references

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications

0 references

Quadratic programming and combinatorial minimum weight product problems

0 references

0 references

Fast Approximation Algorithms for Knapsack Problems

0 references

An FPTAS for optimizing a class of low-rank functions over a polytope

0 references

Parallel Machine Scheduling: Impact of Adding Extra Machines

0 references

Combinatorial Problems: Reductibility and Approximation

0 references

Differential approximation schemes for half-product related functions and their scheduling applications

0 references

A survey on offline scheduling with rejection

0 references

When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

0 references

A strongly polynomial FPTAS for the symmetric quadratic knapsack problem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejor.2018.04.013

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1651695

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1651695&oldid=37834048"