An improved partial enumeration algorithm for integer programming problems

DOI10.1007/s10479-008-0408-0zbMath1163.90666OpenAlexW2059363010MaRDI QIDQ1026562

Richard M. Soland, Mohammad S. Sabbagh

Publication date: 25 June 2009

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0408-0

zbMATH Keywords

integer programmingpartial enumeration speedup

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Non-standard approaches to integer programming
• A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
• 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
• System Availability and Optimum Spare Units
• A Computational Study of Search Strategies for Mixed Integer Programming
• Reliability Optimization Problems with Multiple Constraints
• The Theory and Computation of Knapsack Functions
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved partial enumeration algorithm for integer programming problems