MP
2010
13 years 10 months ago
2010
MP
2010
13 years 10 months ago
2010
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
MP
2010
13 years 10 months ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
MP
2010
13 years 10 months ago
2010
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
MP
2010
13 years 10 months ago
2010
: Each linear program (LP) has an optimal basis. The space of linear programs can be partitioned according to these bases, so called the basis partition. Discovering the structures...
MP
2010
13 years 10 months ago
2010
In this paper, we propose lifting techniques for generating strong cuts for nonlinear programs that are globally-valid. The theory is geometric and provides intuition into lifting...
MP
2010
13 years 10 months ago
2010
In the extension of Newton’s method to generalized equations, applying to variational inequalities as a special case, convergence analysis relates to a corresponding implicit fun...
MP
2010
13 years 10 months ago
2010
MP
2010
13 years 10 months ago
2010
In this paper, we introduce an operation that creates families of facet-defining inequalities for highdimensional infinite group problems using facet-defining inequalities of l...
MP
2010
13 years 10 months ago
2010