A solution procedure for general knapsack problems with a few constraints
type: Item
instance of: scholarly article
title: A solution procedure for general knapsack problems with a few constraints
zbMATH Open document ID: 0693.90070
DOI: 10.1016/0305-0548(88)90007-X
author: Mufit Ozden
published in: Computers \& Operations Research
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 4135713
zbMATH Keywords: general knapsack problems
zbMATH Keywords: few constraints
zbMATH Keywords: forward state generation scheme
MaRDI profile type: Publication
cites work: Q4171868
cites work: A Note on Approximation Schemes for Multidimensional Knapsack Problems
cites work: Zero-one integer programs with few contraints - lower bounding theory
cites work: Zero-one integer programs with few constraints - Efficient branch and bound algorithms
cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
cites work: Computational results with a branch-and-bound algorithm for the general knapsack problem
cites work: Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
cites work: An Algorithm for Nonlinear Knapsack Problems
cites work: A hybrid approach to discrete mathematical programming
cites work: Q3932576
cites work: Surrogate duality in a branch-and-bound procedure for integer programming
cites work: Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
cites work: Q4178782
cites work: Surrogate Constraint Duality in Mathematical Programming
cites work: Symmetric Mathematical Programs
description: scientific article; zbMATH DE number 4135713