A solution procedure for general knapsack problems with a few constraints

DOI10.1016/0305-0548(88)90007-XzbMath0693.90070MaRDI QIDQ908852

Mufit Ozden

Publication date: 1988

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

few constraintsforward state generation schemegeneral knapsack problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Dynamic programming (90C39) Boolean programming (90C09)

Related Items (1)

Dual Inequalities for Stabilized Column Generation Revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-one integer programs with few contraints - lower bounding theory
• Zero-one integer programs with few constraints - Efficient branch and bound algorithms
• Surrogate duality in a branch-and-bound procedure for integer programming
• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• A Note on Approximation Schemes for Multidimensional Knapsack Problems
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• Surrogate Constraint Duality in Mathematical Programming
• An Algorithm for Nonlinear Knapsack Problems
• A hybrid approach to discrete mathematical programming
• Computational results with a branch-and-bound algorithm for the general knapsack problem
• Symmetric Mathematical Programs

This page was built for publication: A solution procedure for general knapsack problems with a few constraints