Computing approximate solutions for convex conic systems of constraints J. PeñaJ. Renegar Pages: 351 - 383
The volume algorithm: producing primal solutions with a subgradient method Francisco BarahonaRanga Anbil Pages: 385 - 399
An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints Le Thi Hoai An Pages: 401 - 426
Totally balanced combinatorial optimization games Xiaotie DengToshihide IbarakiWenan Zang Pages: 441 - 452
A branch-and-cut algorithm for the Undirected Rural Postman Problem Gianpaolo GhianiGilbert Laporte Pages: 467 - 481
The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P-functions Song Xu Pages: 501 - 517
A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem Vladimir G. De&ıbreve;nekoGerhard J. Woeginger Pages: 519 - 542
Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming Serpil Sayın Pages: 543 - 560