327 search results - page 7 / 66 » Cutting planes in integer and mixed integer programming |
120
Voted
DISOPT
2011
14 years 4 months ago
2011
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
114
Voted
JSAT
2006
15 years 1 months ago
2006
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
124
Voted
COLOGNETWENTE
2009
15 years 2 months ago
2009
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
137
Voted
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
113
Voted
MP
2010
14 years 11 months ago
2010
Recently, Andersen et al. [1], Borozan and Cornu´ejols [7] and Cornu´ejols and Margot [10] characterized extreme inequalities of a system of two rows with two free integer varia...