An algorithm for the 0/1 Knapsack problem

DOI10.1007/BF01588947MaRDI QIDQ4149230zbMATH OpenFDO

Authors Marion Lauriere

Publication date 1978

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01588947

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cites work

• A Branch Search Algorithm for the Knapsack Problem
• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
• A Shrinking Boundary Algorithm for Discrete System Models
• An Efficient Algorithm for the 0-1 Knapsack Problem
• Approximate Algorithms for the 0/1 Knapsack Problem
• Bounds on the Number of Feasible Solutions to a Knapsack Problem
• Discrete Programming by the Filter Method
• scientific article; zbMATH DE number 3366470 (Why is no real title available?)
• On the number of solutions to a Diophantine equation
• Préfermeture sur un ensemble ordonné
• Reduction Algorithm for Zero-One Single Knapsack Problems
• Resolution of the 0–1 knapsack problem: Comparison of methods
• The Theory and Computation of Knapsack Functions
• Transformation of integer programs to knapsack problems

Cited in

(5)

• A fully polynomial approximation algorithm for the 0-1 knapsack problem
• Probabilistic analysis of the subset-sum problem
• A language and a program for stating and solving combinatorial problems
• Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben
• An improved enumeration for pure 0-1 programs

This page was built for publication: An algorithm for the 0/1 Knapsack problem

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