The facet ascending algorithm for integer programming problems
Published • Dec 30, 2002
NobleIDNI9P66W79R69S50
Authors:,
R.N. Tomastik
Peter B. Luh
Abstract
Many practical large-scale optimization problems, such as scheduling a manufacturing system, can be modeled as integer programming problems. Because of their combinatorial nature, these problems are often very difficult to solve optimally, especially within a limited amount of time. Therefore, near-...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!