Sensitivity analysis in linear programming and semidefinite programming using interior-point methods E. Alper YıldırımMichael Todd Pages: 229 - 261
On the complexity of a class of combinatorial optimization problems with uncertainty Igor Averbakh Pages: 263 - 272
Optimization via enumeration: a new algorithm for the Max Cut Problem Anna GalluccioMartin LoeblJan Vondrák Pages: 273 - 290
A cutting plane algorithm for the General Routing Problem Angel CorberáanAdam N. LetchfordJosé María Sanchis Pages: 291 - 316
Variational analysis of non-Lipschitz spectral functions James V. BurkeMichael L. Overton Pages: 317 - 351
Combinatorial relaxation algorithm for mixed polynomial matrices Satoru IwataKazuo Murota Pages: 353 - 371
Concavity cuts for disjoint bilinear programming Stéphane AlarieCharles AudetGilles Savard Pages: 373 - 398