77 search results - page 2 / 16 » The Core Concept for 0 1 Integer Programming |
CP
2006
Springer
13 years 9 months ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
OL
2010
13 years 3 months ago
2010
Abstract. We consider the system of m linear equations in n integer variables Ax = d and give sufficient conditions for the uniqueness of its integer solution x ∈ {−1,1}n by r...
VLSID
2007
IEEE
14 years 5 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
IPCO
2001
13 years 6 months ago
2001
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
APN
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The research domain of process discovery aims at constructocess model (e.g. a Petri net) which is an abstract representation of an execution log. Such a Petri net should ...