Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems.

DOI10.1016/S0895-7177(00)00097-2MaRDI QIDQ1597095zbMATH OpenOpenAlexWikidataFDO

Authors Hirokazu Ohtagaki, A. Iwasaki, Yuji Nakagawa, Hiroyuki Narihisa

Publication date 5 May 2002

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0895-7177(00)00097-2

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
• Surrogate Constraints Algorithm for Reliability Optimization Problems with Multiple Constraints
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• Reliability Optimization Problems with Multiple Constraints
• A class of generalized greedy algorithms for the multi-knapsack problem

Cites work

• A hybrid approach to discrete mathematical programming
• Quasi-Convex Programming
• Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
• Surrogate Constraints
• Surrogate Constraints Algorithm for Reliability Optimization Problems with Multiple Constraints
• The Multiple-Choice Knapsack Problem

Cited in

(2)

• An exact solution method for reliability optimization in complex systems
• Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems

This page was built for publication: Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems.

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