A partial enumeration algorithm for pure nonlinear integer programming

DOI10.1016/j.apm.2007.09.003zbMath1167.90598MaRDI QIDQ838194

Mohammad S. Sabbagh

Publication date: 23 August 2009

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2007.09.003

zbMATH Keywords

integer programming; reliability; Knapsack problem; bridge system; partial enumeration speedup; spare allocation

Mathematics Subject Classification ID

90C10: Integer programming

Related Items

An interactive fuzzy satisficing method for multiobjective nonlinear integer programming problems with block-angular structures through genetic algorithms with decomposition procedures

Cites Work

• Unnamed Item
• Unnamed Item
• Non-standard approaches to integer programming
• Evolution and state-of-the-art in integer programming
• A two-phase optimization procedure for integer programming problems
• A computational study of integer programming algorithms based on Barvinok's rational functions
• Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems
• An Automatic Method of Solving Discrete Programming Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• System Availability and Optimum Spare Units
• A Computational Study of Search Strategies for Mixed Integer Programming
• Reliability Optimization Problems with Multiple Constraints
• Discrete Monotonic Optimization with Application to a Discrete Location Problem
• The Theory and Computation of Knapsack Functions
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• A new approach to optimization under monotonic constraint