The zero-one knapsack problem with equality constraint

DOI10.1016/0377-2217(85)90134-1zbMath0564.90034OpenAlexW2027806513MaRDI QIDQ1058453

S. Tubeeckx, Frank Plastria, L. Kaufman

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90134-1

zbMATH Keywords

Lagrangean relaxationcomputational experiencelinear zero-one programmingsingle equality constraintsingle inequality constraintzero-one knapsack

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Boolean programming (90C09)

Related Items (1)

A distributed optimization approach via symmetric group actions under time-varying communication networks

Uses Software

• Algorithm 37

Cites Work

• Unnamed Item
• Unnamed Item
• Accelerating Greenberg's method for the computation of knapsack functions
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• Reduction Algorithm for Zero-One Single Knapsack Problems
• Resolution of the 0–1 knapsack problem: Comparison of methods
• Computing Partitions with Applications to the Knapsack Problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• A Branch Search Algorithm for the Knapsack Problem

This page was built for publication: The zero-one knapsack problem with equality constraint