A Solution Strategy for a Class of Nonlinear Knapsack Problems

DOI10.1080/01966324.1990.10737276MaRDI QIDQ5202519zbMATH OpenOpenAlexFDO

Authors Moshe Sniedovich, Shamsedin Vazirinejad

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

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

Cites work

• 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
• A Stochastic Programming Model
• Analysis of a class of proxy problems
• C-programming and the minimization of pseudolinear and additive concave functions
• C-programming problems: A class of non-linear optimization problems
• C-programming. An outline
• Fractional Programming. II, On Dinkelbach's Algorithm
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 1983335 (Why is no real title available?)
• Maximal mean/standard deviation ratio in an undiscounted MDP
• On Nonlinear Fractional Programming
• Technical Note—Analysis of a Preference Order Traveling Salesman Problem
• The knapsack problem: A survey
• The stochastic linear continuous type knapsack problem: A generalized P model

Cited in

(10)

• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
• An exact solution method for reliability optimization in complex systems
• Experiments with dynamic programming algorithms for nonseparable problems
• A heuristic algorithm for a chance constrained stochastic program
• Strategic oscillation for the quadratic multiple knapsack problem
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
• Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
• Heuristic algorithms for the general nonlinear separable knapsack problem
• A unified method for a class of convex separable nonlinear knapsack problems
• Nonconvex piecewise linear knapsack problems

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

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