77 search results - page 3 / 16 » The Core Concept for 0 1 Integer Programming |
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...
WEA
2010
Springer
14 years 1 months ago
2010
Springer
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
13 years 2 months ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
MP
2006
13 years 7 months ago
2006
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
IEEEARES
2007
IEEE
14 years 1 months ago
2007
IEEE
The issue of information security has attracted increasing attention in recent years. In network attack and defense scenarios, attackers and defenders constantly change their resp...