Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation Denis NaddefStefan Thienel Pages: 237 - 255
Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities Denis NaddefStefan Thienel Pages: 257 - 283
Randomized pivot algorithms for P-matrix linear complementarity problems Walter D. Morris jr. Pages: 285 - 296
On splittable and unsplittable flow capacitated network design arc–set polyhedra Alper AtamtürkDeepak Rajan Pages: 315 - 333
Polyhedral results for the edge capacity polytope Stan P.M. van HoeselArie M.C.A. KosterMartin W.P. Savelsbergh Pages: 335 - 358
On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy Mihai Anitescu Pages: 359 - 386