2976 search results - page 61 / 596 » On the bounded integer programming |
CADE
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...
CSJM
2006
13 years 10 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
JPDC
2008
13 years 10 months ago
2008
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
CHARME
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
AUSSOIS
2001
Springer
14 years 2 months ago
2001
Springer
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...