Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
From MaRDI portal
Publication:1977259
DOI10.1016/S0167-6377(99)00066-8zbMath0946.90051MaRDI QIDQ1977259
Michael M. Güntzer, Dieter Jungnickel
Publication date: 30 October 2000
Published in: Operations Research Letters (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items (17)
Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem ⋮ Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ Algorithms with guarantee value for knapsack problems ⋮ Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations ⋮ Online removable knapsack with limited cuts ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ Online minimization knapsack problem ⋮ Online removable knapsack problem under convex function ⋮ ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES ⋮ Algorithms for solving the single-sink fixed-charge transportation problem ⋮ 2D Knapsack: Packing Squares ⋮ Nonconvex piecewise linear knapsack problems ⋮ Single-machine scheduling under the job rejection constraint ⋮ Bandwidth Constrained Multi-interface Networks ⋮ Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs ⋮ Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product ⋮ Improved algorithms for single machine scheduling with release dates and rejections
Cites Work
This page was built for publication: Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
