scientific article; zbMATH DE number 3606249

zbMath0389.90071MaRDI QIDQ4171868

Eugene L. Lawler

Publication date: 1978

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean programming (90C09)

Related Items

An introduction to the analysis of approximation algorithms, Joint performance of greedy heuristics for the integer knapsack problem, Toward a model for backtracking and dynamic programming, A solution procedure for general knapsack problems with a few constraints, A fully polynomial approximation algorithm for the 0-1 knapsack problem, Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack, Unnamed Item, A total-value greedy heuristic for the integer knapsack problem, Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses