scientific article; zbMATH DE number 3606249

MaRDI QIDQ4171868zbMATH OpenFDO

Authors Eugene L. Lawler

Publication date 1978

Mathematics Subject Classification ID

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

Cited in

(9)

• An introduction to the analysis of approximation algorithms
• A fully polynomial approximation algorithm for the 0-1 knapsack problem
• A total-value greedy heuristic for the integer knapsack problem
• Joint performance of greedy heuristics for the integer knapsack problem
• Integrality gaps of linear and semi-definite programming relaxations for knapsack
• scientific article; zbMATH DE number 3770975 (Why is no real title available?)
• Toward a model for backtracking and dynamic programming
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• A solution procedure for general knapsack problems with a few constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4171868)