On maximization of quadratic form over intersection of ellipsoids with common center A. NemirovskiC. RoosT. Terlaky Pages: 463 - 473
Feasible descent algorithms for mixed complementarity problems Michael C. FerrisChristian KanzowTodd S. Munson Pages: 475 - 497
A new bound for the ratio between the 2-matching problem and its linear programming relaxation Sylvia BoydRobert Carr Pages: 499 - 514
A branch-and-cut method for 0-1 mixed convex programming Robert A. StubbsSanjay Mehrotra Pages: 515 - 532
A non-interior continuation method for generalized linear complementarity problems Ji-Ming PengZhenghua Lin Pages: 533 - 563
Computational study of a column generation algorithm for bin packing and cutting stock problems François Vanderbeck Pages: 565 - 594
Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption Matthias HeinkenschlossMichael UlbrichStefan Ulbrich Pages: 615 - 635
Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure S.R. MohanS.K. NeogyS. Sinha Pages: 637 - 648
Properties of an interior embedding for solving nonlinear optimization problems Walter Gómez Bofill Pages: 649 - 659