INFORMS Journal on Computing, Volume 4

Volume 4, Number 1, Winter 1992

• Harvey J. Greenberg:
  Editor's Introduction. 1
  
• Stuart Smith, Leon S. Lasdon:
  Solving Large Sparse Nonlinear Programs Using GRG. 2-15
  
• Robert Fourer, Roy E. Marsten:
  Solving Piecewise-Linear Programs: Experiments with a Simplex Approach. 16-31
  
• Ulrich Faigle, Walter Kern:
  Some Convergence Results for Probabilistic Tabu Search. 32-37
  
• James K. Hurd, Frederic H. Murphy:
  Exploiting Special Structure in Primal Dual Interior Point Methods. 38-44
  
• Stein W. Wallace, Roger J.-B. Wets:
  Preprocessing in Stochastic Programming: The Case of Linear Programs. 45-59
  
• Leonid B. Boguslavsky, Edward G. Coffman Jr., Edgar N. Gilbert, Alexander Y. Kreinin:
  Scheduling Checks and Saves. 60-69
  
• Jon Lee, Jennifer Ryan:
  Matroid Applications and Algorithms. 70-98
  
• Rakesh V. Vohra:
  Book Review. 99
  

Volume 4, Number 2, Spring 1992

• Harvey J. Greenberg:
  Editor's Introduction. 101-102
  
• Sanjay Mehrotra:
  Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods. 103-118
  
• Weldon A. Lodwick:
  Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem. 119-131
  
• Robert H. Clark, Jeffery L. Kennington, Robert R. Meyer, Muthukrishnan Ramamurti:
  Generalized Networks: Parallel Algorithms and an Empirical Analysis. 132-145
  
• Martin W. P. Savelsbergh:
  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration. 146-154
  
• R. Ramesh, Yong-Seok Yoon, Mark H. Karwan:
  An Optimal Algorithm for the Orienteering Tour Problem. 155-165
  
• Søren S. Nielsen, Stavros A. Zenios:
  Massively Parallel Algorithms for Singly Constrained Convex Programs. 166-181
  
• Tao Yang, Morton J. M. Posner, James G. C. Templeton:
  The Ca/M/s/m Retrial Queue: A Computational Approach. 182-191
  
• Anantaram Balakrishnan, Kemal Altinkemer:
  Using a Hop-Constrained Model to Generate Alternative Communication Network Design. 192-205
  
• Gerhard Reinelt:
  Fast Heuristics for Large Geometric Traveling Salesman Problems. 206-217
  
• Nageswara S. V. Rao:
  Technical Note - On Performance of Path Planning Algorithms in Unknown Terrains. 218-224
  

Volume 4, Number 3, Summer 1992

• Bruce L. Golden:
  From the Editor. 225
  
• Peter W. Glynn, Philip Heidelberger:
  Jackknifing under a Budget Constraint. 226-234
  
• Mustafa Ç. Pinar, Stavros A. Zenios:
  Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm. 235-249
  
• Frank Yeong-Sung Lin, James R. Yee:
  A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks. 250-266
  
• Robert E. Bixby:
  Implementing the Simplex Method: The Initial Basis. 267-284
  
• Chris Fraley, Jean-Philippe Vial:
  Alternative Approaches to Feasibility in Projective Methods for Linear Programming. 285-299
  
• Mohan L. Chaudhry:
  Numerical Issues in Computing Steady-State Queueing-Time Distributions of Single-Server Bulk-Service Queues: M/Gb/1 and M/Gd/1. 300-310
  
• Julio M. Stern:
  Simulated Annealing with a Temperature Dependent Penalty Function. 311-319
  
• Sunil Chopra, Edgar R. Gorres, M. R. Rao:
  Solving the Steiner Tree Problem on a Graph Using Branch and Cut. 320-335
  
• William J. Stewart, Wei Wu:
  Numerical Experiments with Iteration and Aggregation for Markov Chains. 336-350
  
• Parviz Ghandforoush, John J. Daniels:
  A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem. 351-356
  

Volume 4, Number 4, Fall 1992

• Joseph S. B. Mitchell, Jan Karel Lenstra:
  Guest Editors' Introduction. 357-359
  
• David Eppstein:
  Dynamic Three-Dimensional Linear Programming. 360-368
  
• David Hartvigsen:
  Recognizing Voronoi Diagrams with Linear Programming. 369-374
  
• Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman:
  Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms. 375-386
  
• Jon Jouis Bentley:
  Fast Algorithms for Geometric Traveling Salesman Problems. 387-411
  
• S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel:
  The Voronoi Partition of a Network and Its Implications in Location Theory. 412-417
  
• Hossam ElGindy, J. Mark Keil:
  Efficient Algorithms for the Capacitated 1-Median Problem. 418-425
  
• Hiroshi Imai, D. T. Lee, Chung-Do Yang:
  1-Segment Center Problems. 426-434
  
• Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri:
  On the Optimal Bisection of a Polygon. 435-438
  
• V. Chandru, V. T. Rajan, R. Swaminathan:
  Monotone Pieces of Chains. 439-446
  
• Laurent Alonso, Arthur S. Goldstein, Edward M. Reingold:
  "Lion and Man": Upper and Lower Bounds. 447-452