28 search results - page 5 / 6 » Semi-continuous Cuts for Mixed-Integer Programming |
ENDM
2010
13 years 2 months ago
2010
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Exte...
CPAIOR
2010
Springer
13 years 8 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
ICML
2010
IEEE
13 years 6 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...
COR
2007
13 years 5 months ago
2007
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...