A generalized knapsack problem with variable coefficients

DOI10.1007/BF01609015zbMath0391.90070OpenAlexW2020081923MaRDI QIDQ4173196

Hisatoshi Suzuki

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

Computational EfficiencyBranch And Bound AlgorithmProduction PlanningMixed Integer ProgrammingGeneralized Knapsack ProblemVariable Coefficients

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Production models (90B30)

Related Items (1)

A penalty algorithm for solving convex separable knapsack problems

Cites Work

• Unnamed Item
• Branch-and-Bound Strategies for Dynamic Programming
• The Theory and Computation of Knapsack Functions
• A Branch Search Algorithm for the Knapsack Problem

This page was built for publication: A generalized knapsack problem with variable coefficients