A partial enumeration algorithm for pure nonlinear integer programming
type: Item
instance of: scholarly article
title: A partial enumeration algorithm for pure nonlinear integer programming
zbMATH Open document ID: 1167.90598
author: Mohammad S. Sabbagh
published in: Applied Mathematical Modelling
publication date: 2009-08-23T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5597957
zbMATH Keywords: bridge system
zbMATH Keywords: integer programming
zbMATH Keywords: Knapsack problem
zbMATH Keywords: partial enumeration speedup
zbMATH Keywords: reliability
zbMATH Keywords: spare allocation
MaRDI profile type: Publication
full work available at URL: j.apm.2007.09.003
OpenAlex ID: W1974868713
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Q5610172
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Reliability Optimization Problems with Multiple Constraints
cites work: The Theory and Computation of Knapsack Functions
cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables
cites work: System Availability and Optimum Spare Units
cites work: A two-phase optimization procedure for integer programming problems
cites work: Non-standard approaches to integer programming
cites work: A Computational Study of Search Strategies for Mixed Integer Programming
cites work: Evolution and state-of-the-art in integer programming
cites work: Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems
cites work: A new approach to optimization under monotonic constraint
cites work: Discrete Monotonic Optimization with Application to a Discrete Location Problem
cites work: Q4737538
cites work: A computational study of integer programming algorithms based on Barvinok's rational functions
DOI: 10.1016/J.APM.2007.09.003
description: scientific article; zbMATH DE number 5597957