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

DOI10.1016/S0895-7177(00)00097-2zbMath1042.90547OpenAlexW1968050691WikidataQ127396145 ScholiaQ127396145MaRDI QIDQ1597095

A. Iwasaki, H. Ohtagaki, 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

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

Related Items (1)

An exact solution method for reliability optimization in complex systems

Cites Work

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

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