A generalized knapsack problem with variable coefficients

DOI10.1007/BF01609015MaRDI QIDQ4173196zbMATH OpenOpenAlexFDO

Authors 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

Branch And Bound AlgorithmComputational EfficiencyGeneralized Knapsack ProblemMixed Integer ProgrammingProduction PlanningVariable Coefficients

Mathematics Subject Classification ID

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

Cites work

• A Branch Search Algorithm for the Knapsack Problem
• Branch-and-Bound Strategies for Dynamic Programming
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• The Theory and Computation of Knapsack Functions

Cited in

(1)

• A penalty algorithm for solving convex separable knapsack problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4173196)