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

DOI10.1007/BF01580448zbMath0314.90062OpenAlexW1989184333MaRDI QIDQ4074670

Gérard Plateau, Didier Fayard

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)

Related Items

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

Cites Work

• Unnamed Item
• Transformation of integer programs to knapsack problems
• Discrete Programming by the Filter Method
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• Surrogate Constraints
• Integer Linear Programming: A Study in Computational Efficiency
• An Improved Implicit Enumeration Approach for Integer Programming
• A Branch Search Algorithm for the Knapsack Problem
• A Shrinking Boundary Algorithm for Discrete System Models
• Integer Programming by Implicit Enumeration and Balas’ Method