A Solution Strategy for a Class of Nonlinear Knapsack Problems

DOI10.1080/01966324.1990.10737276zbMath0724.90070OpenAlexW2058773944MaRDI QIDQ5202519

Shamsedin Vazirinejad, Moshe Sniedovich

Publication date: 1990

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1990.10737276

zbMATH Keywords

c-programmingfractional objective functionsnon-standard knapsack problems

Mathematics Subject Classification ID

Integer programming (90C10) Fractional programming (90C32) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Experiments with dynamic programming algorithms for nonseparable problems ⋮ A heuristic algorithm for a chance constrained stochastic program ⋮ An exact solution method for reliability optimization in complex systems

Cites Work

• Unnamed Item
• Unnamed Item
• C-programming and the minimization of pseudolinear and additive concave functions
• C-programming problems: A class of non-linear optimization problems
• The stochastic linear continuous type knapsack problem: A generalized P model
• Analysis of a class of proxy problems
• C-programming. An outline
• Maximal mean/standard deviation ratio in an undiscounted MDP
• A class of nonseparable dynamic programming problems
• A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
• A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
• Technical Note—Analysis of a Preference Order Traveling Salesman Problem
• The knapsack problem: A survey
• Fractional Programming. II, On Dinkelbach's Algorithm
• A Stochastic Programming Model
• On Nonlinear Fractional Programming

This page was built for publication: A Solution Strategy for a Class of Nonlinear Knapsack Problems