scientific article

zbMath0535.90069MaRDI QIDQ3320130

Bernhard Korte, Rainer Schrader

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

combinatorial optimizationknapsack problempolynomially bounded algorithms527.0013characterization of polynomially solvable problemsfast approximation scheme

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Related Items (25)

Multistage knapsack ⋮ An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem ⋮ On the complexity of computing the diameter of a polytope ⋮ New applications of partial orders ⋮ On the complexity of working set selection ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ On parallel versus sequential approximation ⋮ Approximation schemes for generalized two-dimensional vector packing with application to data placement ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Reductions between scheduling problems with non-renewable resources and knapsack problems ⋮ The preemptive stochastic resource-constrained project scheduling problem ⋮ A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem ⋮ Approximate solution of NP optimization problems ⋮ Local search, reducibility and approximability of NP-optimization problems ⋮ On the computational complexity of reliability redundancy allocation in a series system ⋮ Unnamed Item ⋮ Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ Bi-criteria path problem with minimum length and maximum survival probability ⋮ There is no EPTAS for two-dimensional knapsack ⋮ Approximation algorithms for knapsack problems with cardinality constraints ⋮ Recent trends in combinatorial optimization ⋮ Approximations to clustering and subgraph problems on trees ⋮ Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem

This page was built for publication: