327 search results - page 9 / 66 » Cutting planes in integer and mixed integer programming |
ANOR
2005
13 years 10 months ago
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
IPCO
2007
14 years 9 days ago
2007
In this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice poin...
MP
2006
13 years 10 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
SDM
2008
SIAM
14 years 9 days ago
2008
SIAM
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
MP
2002
13 years 10 months ago
2002
We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem....