Sciweavers

30 search results - page 5 / 6
» Cuts for Conic Mixed-Integer Programming
Sort
View
IPCO
2010
174views Optimization» more  IPCO 2010»
14 years 11 months ago
On Lifting Integer Variables in Minimal Inequalities
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tab...
Amitabh Basu, Manoel B. Campêlo, Michele Con...
MOR
2008
67views more  MOR 2008»
14 years 9 months ago
An Analytic Center Cutting Plane Approach for Conic Programming
Vasile L. Basescu, John E. Mitchell
CPAIOR
2010
Springer
15 years 25 days ago
An In-Out Approach to Disjunctive Optimization
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...
Matteo Fischetti, Domenico Salvagnin
ICML
2010
IEEE
14 years 10 months ago
Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets
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...
Mingkui Tan, Li Wang, Ivor W. Tsang
COR
2007
176views more  COR 2007»
14 years 9 months ago
Scheduling and routing of automated guided vehicles: A hybrid approach
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...
Ayoub Insa Corréa, André Langevin, L...