On the use of an inverse shortest paths algorithm for recovering linearly correlated costs D. BurtonPh. L. Toint OriginalPaper Pages: 1 - 22
A technique for speeding up the solution of the Lagrangean dual Dimitris BertsimasJames B. Orlin OriginalPaper Pages: 23 - 45
Efficient enumeration of the vertices of polyhedra associated with network LP's J. Scott Provan OriginalPaper Pages: 47 - 64
Inexact subgradient methods with applications in stochastic programming Kelly T. AuJulia L. HigleSuvrajeet Sen OriginalPaper Pages: 65 - 82
A deep cut ellipsoid algorithm for convex programming: Theory and applications J. B. G. FrenkJ. GromichoS. Zhang OriginalPaper Pages: 83 - 108
A Farkas lemma for difference sublinear systems and quasidifferentiable programming B. M. GloverV. JeyakumarW. Oettli OriginalPaper Pages: 109 - 125
Representations of quasi-Newton matrices and their use in limited memory methods Richard H. ByrdJorge NocedalRobert B. Schnabel OriginalPaper Pages: 129 - 156
Global minimization by reducing the duality gap Aharon Ben-TalGideon EigerVladimir Gershovitz OriginalPaper Pages: 193 - 212
Examples of max-flow and min-cut problems with duality gaps in continuous networks Ryôhei Nozawa OriginalPaper Pages: 213 - 234
A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point Hans KremersDolf Talman OriginalPaper Pages: 235 - 252
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits M. JüngerA. MartinR. Weismantel OriginalPaper Pages: 257 - 279
The rectilinear class Steiner tree problem for intervals on two parallel lines Edmund Ihler OriginalPaper Pages: 281 - 296
The pin redistribution problem in multi-chip modules Jun Dong ChoMajid Sarrafzadeh OriginalPaper Pages: 297 - 330
A strategy for array management in local memory Christine EisenbeisWilliam JalbyFrançois Bodin OriginalPaper Pages: 331 - 370
Optimal mapping in direct mapped cache environments S. GalY. HollanderA. Itai OriginalPaper Pages: 371 - 387