Sciweavers

55 search results - page 2 / 11
» A warm-start approach for large-scale stochastic linear prog...
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 6 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
MP
2008
117views more  MP 2008»
13 years 5 months ago
Stochastic programming approach to optimization under uncertainty
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
Alexander Shapiro
COR
2007
105views more  COR 2007»
13 years 5 months ago
Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
Column generation has proven to be efficient in solving the linear programming relaxation of large scale instances ofthemultiple-depotvehicleschedulingproblem(MDVSP).Howeverdif...
Amar Oukil, Hatem Ben Amor, Jacques Desrosiers, Hi...
IOR
2008
98views more  IOR 2008»
13 years 5 months ago
A Linear Decision-Based Approximation Approach to Stochastic Programming
Xin Chen, Melvyn Sim, Peng Sun, Jiawei Zhang