Lectures on mathematical programming ismp97 Thomas M. LieblingDominique de Werra Preface Pages: 1 - 2
How to deal with the unbounded in optimization: Theory and algorithms A. Auslender OriginalPaper Pages: 3 - 18
Efficiently solvable special cases of hard combinatorial optimization problems Rainer E. Burkard OriginalPaper Pages: 55 - 69
Two applications of the divide&conquer principle in the molecular sciences G. BrinkmannA. W. M. DressJ. Stoye OriginalPaper Pages: 71 - 97
Interactions between nonlinear programming and modeling systems Arne Stolbjerg Drud OriginalPaper Pages: 99 - 123
Algorithms for railway crew management Alberto CapraraMatteo FischettiPier Luigi Guida OriginalPaper Pages: 125 - 141
Semidefinite programming in combinatorial optimization Michel X. Goemans OriginalPaper Pages: 143 - 161
Logical analysis of numerical data Endre BorosPeter L. HammerAlexander Kogan OriginalPaper Pages: 163 - 190
Cluster analysis and mathematical programming Pierre HansenBrigitte Jaumard OriginalPaper Pages: 191 - 215
Linear programming, the simplex algorithm and simple polytopes Gil Kalai OriginalPaper Pages: 217 - 233
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming Katsuki FujisawaMasakazu KojimaKazuhide Nakata OriginalPaper Pages: 235 - 253
Interior-point methods: An old and new approach to nonlinear programming Yu. Nesterov OriginalPaper Pages: 285 - 297
Criss-cross methods: A fresh view on pivot algorithms Komei FukudaTamás Terlaky OriginalPaper Pages: 369 - 395
Recent progress in unconstrained nonlinear optimization without derivatives A. R. ConnK. ScheinbergPh. L. Toint OriginalPaper Pages: 397 - 414
Discrete optimization in public rail transport M. R. BussieckT. WinterU. T. Zimmermann OriginalPaper Pages: 415 - 444
Free material optimization via mathematical programming Jochem ZoweMichal KočvaraMartin P. Bendsøe OriginalPaper Pages: 445 - 466