Concurrent stochastic methods for global optimization Richard H. ByrdCornelius L. DertRobert B. Schnabel OriginalPaper Pages: 1 - 29
The generalized assignment problem: Valid inequalities and facets Elsie Sterbin GottliebM. R. Rao OriginalPaper Pages: 31 - 52
(1,k)-configuration facets for the generalized assignment problem Elsie Sterbin GottliebM. R. Rao OriginalPaper Pages: 53 - 60
An exponential example for Terlaky's pivoting rule for the criss-cross simplex method C. Roos OriginalPaper Pages: 79 - 84
Proximity control in bundle methods for convex nondifferentiable minimization Krzysztof C. Kiwiel OriginalPaper Pages: 105 - 122
Announcement: Nato asi course computer algorithms for solving linear algebraic systems: The state of art Notice Pages: 125 - 125
Relaxation methods for monotropic programs Paul TsengDimitri P. Bertsekas OriginalPaper Pages: 127 - 151
Minimum-weight two-connected spanning networks Clyde L. MonmaBeth Spellman MunsonWilliam R. Pulleyblank OriginalPaper Pages: 153 - 171
Asymptotic behaviour of Karmarkar's method for linear programming Miroslav D. AsicVera V. Kovacevic-VujcicMirjana D. Radosavljevic-Nikolic OriginalPaper Pages: 173 - 190
A filled function method for finding a global minimizer of a function of several variables Renpu Ge OriginalPaper Pages: 191 - 204
Value functions, domination cones and proper efficiency in multicriteria optimization Mordechai I. Henig OriginalPaper Pages: 205 - 217
Algebraic optimization: The Fermat-Weber location problem R. ChandrasekaranA. Tamir OriginalPaper Pages: 219 - 224
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm Frieda GranotJadranka Skorin-Kapov OriginalPaper Pages: 225 - 236
A probabilistic analysis of the multiknapsack value function M. MeantiA. H. G. Rinnooy KanC. Vercellis OriginalPaper Pages: 237 - 247
A note on an implementation of a method for quadratic semi-infinite programming R. HettichG. Gramlich OriginalPaper Pages: 249 - 254
A short proof of finiteness of Murty's principal pivoting algorithm Jiri Rohn OriginalPaper Pages: 255 - 256
Approximation algorithms for scheduling unrelated parallel machines Jan Karel LenstraDavid B. ShmoysÉva Tardos OriginalPaper Pages: 259 - 271
A projection method for the uncapacitated facility location problem A. R. ConnG. CornuéJols OriginalPaper Pages: 273 - 298
On the improvement per iteration in Karmarkar's algorithm for linear programming Colin Mcdiarmid OriginalPaper Pages: 299 - 320
An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds P. M. PardalosN. Kovoor OriginalPaper Pages: 321 - 328
Generalized linear complementarity problems M. Seetharama GowdaThomas I. Seidman OriginalPaper Pages: 329 - 340
The augmented lagrangian method for equality and inequality constraints in hilbert spaces K. ItoK. Kunisch OriginalPaper Pages: 341 - 360
On patching algorithms for random asymmetric travelling salesman problems M. E. DyerA. M. Frieze OriginalPaper Pages: 361 - 378
A recursive procedure to generate all cuts for 0–1 mixed integer programs George L. NemhauserLaurence A. Wolsey OriginalPaper Pages: 379 - 390
Exchange price equilibria and variational inequalities Stella Dafermos OriginalPaper Pages: 391 - 402
On Shapiro's results in quasidifferential calculus Bernd LudererRoland Rösiger OriginalPaper Pages: 403 - 407
