189 search results - page 8 / 38 » A generalization of the integer linear infeasibility problem |
INFORMS
1998
13 years 7 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
FAW
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
ICCD
2004
IEEE
2004
IEEE
Circuit-Based Preprocessing of ILP and Its Applications in Leakage Minimization and Power Estimation
14 years 4 months ago
In this paper we discuss the application of circuit-based logical reasoning to simplify optimization problems expressed as integer linear programs (ILP) over circuit states. We de...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
ORL
1998
13 years 7 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...