An improved partial enumeration algorithm for integer programming problems
type: Item
instance of: scholarly article
title: An improved partial enumeration algorithm for integer programming problems
zbMATH Open document ID: 1163.90666
author: Mohammad S. Sabbagh
author: Richard M. Soland
published in: Annals of Operations Research
publication date: 2009-06-25T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5570701
zbMATH Keywords: integer programming
zbMATH Keywords: partial enumeration speedup
MaRDI profile type: Publication
full work available at URL: s10479-008-0408-0
OpenAlex ID: W2059363010
cites work: Q4737538
cites work: Non-standard approaches to integer programming
cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables
cites work: Reliability Optimization Problems with Multiple Constraints
cites work: A computational study of integer programming algorithms based on Barvinok's rational functions
cites work: The Theory and Computation of Knapsack Functions
cites work: Q5338598
cites work: Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: A Computational Study of Search Strategies for Mixed Integer Programming
cites work: A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
cites work: Q4943600
cites work: System Availability and Optimum Spare Units
cites work: Evolution and state-of-the-art in integer programming
cites work: A two-phase optimization procedure for integer programming problems
DOI: 10.1007/S10479-008-0408-0
description: scientific article; zbMATH DE number 5570701