Resolution of the 0–1 knapsack problem: Comparison of methods

DOI10.1007/BF01580448MaRDI QIDQ4074670zbMATH OpenOpenAlexFDO

Authors Didier Fayard, Gérard Plateau

Publication date 1975

Published in Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cites work

• A Branch Search Algorithm for the Knapsack Problem
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• A Shrinking Boundary Algorithm for Discrete System Models
• An Improved Implicit Enumeration Approach for Integer Programming
• Discrete Programming by the Filter Method
• scientific article; zbMATH DE number 3468554 (Why is no real title available?)
• Integer Linear Programming: A Study in Computational Efficiency
• Integer Programming by Implicit Enumeration and Balas’ Method
• Surrogate Constraints
• Transformation of integer programs to knapsack problems

Cited in

(16)

• The zero-one knapsack problem with equality constraint
• A new enumeration scheme for the knapsack problem
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems
• An algorithm for the solution of the 0-1 knapsack problem
• An algorithm and efficient data structures for the binary knapsack problem
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
• Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem
• A pegging approach to the precedence-constrained knapsack problem
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem
• A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem
• Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben
• A o(n logn) algorithm for LP knapsacks with GUB constraints
• An algorithm for the 0/1 Knapsack problem

This page was built for publication: Resolution of the 0–1 knapsack problem: Comparison of methods

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