Packing and covering with integral feasible flows in integral supply-demand networks R. E. BixbyO. M. -C. MarcotteL. E. Trotter Jr. OriginalPaper Pages: 231 - 239
The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria T. M. DoupG. van der LaanA. J. J. Talman OriginalPaper Pages: 241 - 252
Counting almost minimum cutsets with reliability applications Aparna RamanathanCharles J. Colbourn OriginalPaper Pages: 253 - 261
LP extreme points and cuts for the fixed-charge network design problem Anantaram Balakrishnan OriginalPaper Pages: 263 - 284
Generalized convexity and concavity of the optimal value function in nonlinear programming Jerzy KyparisisAnthony V. Fiacco OriginalPaper Pages: 285 - 304
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming Yinyu YEMasakazu Kojima OriginalPaper Pages: 305 - 317
A primal-dual algorithm for the fermat-weber problem involving mixed gauges C. MichelotO. Lefebvre OriginalPaper Pages: 319 - 335
An outer-approximation algorithm for a class of mixed-integer nonlinear programs Marco A. DuranIgnacio E. Grossmann Notice Pages: 337 - 337