Reducing the number of variables in Integer and Linear Programming Problems Djangir A. BabayevSahib S. Mardanov OriginalPaper Pages: 99 - 109
Solving binary cutting stock problems by column generation and branch-and-bound Pamela H. VanceCynthia BarnhartGeorge L. Nemhauser OriginalPaper Pages: 111 - 130
Local convergence of interior-point algorithms for degenerate monotone LCP Renato D. C. MonteiroStephen J. Wright OriginalPaper Pages: 131 - 155
A parameterized Newton method and a quasi-Newton method for nonsmooth equations Xiaojun ChenLiqun Qi OriginalPaper Pages: 157 - 179
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities Hiroshi KonnoYasutoshi YajimaAyumi Ban OriginalPaper Pages: 181 - 191