An algorithm for the 0/1 Knapsack problem

DOI10.1007/BF01588947zbMath0372.90095MaRDI QIDQ4149230

Marion Lauriere

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (5)

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

Cites Work

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

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