Sciweavers

205 search results - page 15 / 41
» Valid inequalities for mixed integer linear programs
Sort
View
DISOPT
2011
175views Education» more  DISOPT 2011»
13 years 3 days ago
Strengthening lattice-free cuts using non-negativity
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...
Ricardo Fukasawa, Oktay Günlük
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
14 years 3 months ago
Multi-robot routing with linear decreasing rewards over time
Abstract— We study multi-robot routing problems (MRLDR) where a team of robots has to visit a set of given targets with linear decreasing rewards over time, such as required for ...
Ali Ekici, Pinar Keskinocak, Sven Koenig
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 8 months ago
A Semidefinite Relaxation for Air Traffic Flow Scheduling
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
Alexandre d'Aspremont, Laurent El Ghaoui
ANOR
2005
131views more  ANOR 2005»
13 years 8 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
SIAMJO
2010
121views more  SIAMJO 2010»
13 years 7 months ago
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
Identifying small groups of lines, whose removal would cause a severe blackout, is critical for the secure operation of the electric power grid. We show how power grid vulnerabilit...
Ali Pinar, Juan Meza, Vaibhav Donde, Bernard C. Le...