MP
2006
13 years 4 months ago
2006
We introduce strong formulations for robust mixed 0
MP
2006
13 years 4 months ago
2006
The vast size of real world stochastic programming instances requires sampling to make them practically solvable. In this paper we extend the understanding of how sampling affects ...
MP
2006
13 years 4 months ago
2006
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
MP
2006
13 years 4 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
MP
2006
13 years 4 months ago
2006
We present a time-stepping method to simulate rigid multibody dynamics with inelastic collision, contact, and friction. The method progresses with fixed time step without backtrac...
MP
2006
13 years 4 months ago
2006
MP
2006
13 years 4 months ago
2006
MP
2006
13 years 4 months ago
2006
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
MP
2006
13 years 4 months ago
2006
In this paper, we propose a new methodology for handling optimization problems with uncertain data. With the usual Robust Optimization paradigm, one looks for the decisions ensurin...