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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2018.04.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2796556323
@@ Property / OpenAlex ID: W2796556323 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimization of Half-Products
@@ Property / cites work: Minimization of Half-Products / rank @@
+Normal rank
@@ Property / cites work @@
+Single-item dynamic lot-sizing problems: an updated survey
+Normal rank
@@ Property / cites work @@
+An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
+Normal rank
@@ Property / cites work @@
+A single-item economic lot-sizing problem with a non-uniform resource: Approximation
+Normal rank
@@ Property / cites work @@
+FPTAS for half-products minimization with scheduling applications
+Normal rank
@@ Property / cites work @@
+An FPTAS for minimizing the product of two non-negative linear cost functions
+Normal rank
@@ Property / cites work @@
+An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
+Normal rank
@@ Property / cites work @@
+Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
+Normal rank
@@ Property / cites work @@
+A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
+Normal rank
@@ Property / cites work @@
+Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle
+Normal rank
@@ Property / cites work @@
+Analysis of bounds for a capacitated single-item lot-sizing problem
+Normal rank
@@ Property / cites work @@
+A nonlinear knapsack problem
@@ Property / cites work: A nonlinear knapsack problem / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and algorithms for nonlinear optimization problems
+Normal rank
@@ Property / cites work @@
+About strongly polynomial time algorithms for quadratic optimization over submodular constraints
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Certain Scheduling Problems
+Normal rank
@@ Property / cites work @@
+Positive half-products and scheduling with controllable processing times
+Normal rank
@@ Property / cites work @@
+An efficient fully polynomial approximation scheme for the Subset-Sum problem.
+Normal rank
@@ Property / cites work @@
+A new fully polynomial time approximation scheme for the Knapsack problem
+Normal rank
@@ Property / cites work @@
+Improved dynamic programming in connection with an FPTAS for the knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability issues for unconstrained and constrained maximization of half-product related functions
+Normal rank
@@ Property / cites work @@
+Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
+Normal rank
@@ Property / cites work @@
+MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK
+Normal rank
@@ Property / cites work @@
+The symmetric quadratic knapsack problem: approximation and scheduling applications
+Normal rank
@@ Property / cites work @@
+Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
+Normal rank
@@ Property / cites work @@
+Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
+Normal rank
@@ Property / cites work @@
+Quadratic programming and combinatorial minimum weight product problems
+Normal rank
@@ Property / cites work @@
+Q3123417
@@ Property / cites work: Q3123417 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+An FPTAS for optimizing a class of low-rank functions over a polytope
+Normal rank
@@ Property / cites work @@
+Parallel Machine Scheduling: Impact of Adding Extra Machines
+Normal rank
@@ Property / cites work @@
+Combinatorial Problems: Reductibility and Approximation
+Normal rank
@@ Property / cites work @@
+Differential approximation schemes for half-product related functions and their scheduling applications
+Normal rank
@@ Property / cites work @@
+A survey on offline scheduling with rejection
@@ Property / cites work: A survey on offline scheduling with rejection / rank @@
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank
@@ Property / cites work @@
+A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
+Normal rank
@@ Property / Wikidata QID @@
+Q130037988
@@ Property / Wikidata QID: Q130037988 / rank @@
+Normal rank