Mathematical Programming, Volume 96

Volume 96, Number 1, April 2003

• Tim Olson, Jong-Shi Pang, Carey E. Priebe:
  A likelihood-MPEC approach to target classification. 1-31
  
• Jonathan Eckstein:
  A practical general approximation criterion for methods of multipliers based on Bregman distances. 61-86
  
• Clovis C. Gonzaga, Rómulo A. Castillo:
  A nonlinear programming algorithm based on non-coercive penalty functions. 87-101
  
• Angel Corberán, Antonio Romero, José M. Sanchis:
  The mixed general routing polyhedron. 103-137
  
• J. J. Ye, Qiji J. Zhu:
  Multiobjective optimization problem with variational inequality constraints. 139-160
  
• Choong Ming Chin, Roger Fletcher:
  On the global convergence of an SLP-filter algorithm that takes EQP steps. 161-177
  

Volume 96, Number 2, May 2003

• Karen Aardal, Rekha R. Thomas:
  Algebraic and geometric methods in discrete optimization. 179-179
  
• Ralph E. Gomory, Ellis L. Johnson:
  An approach to integer programming. 181-181
  
• Jesús A. De Loera, Bernd Sturmfels:
  Algebraic unimodular counting. 183-203
  
• Utz-Uwe Haus, Matthias Köppe, Robert Weismantel:
  A primal all-integer algorithm based on irreducible solutions. 205-246
  
• Raymond Hemmecke:
  On the positive sum property and the computation of Graver test sets. 247-269
  
• Serkan Hosten, Rekha R. Thomas:
  Gomory integer programs. 271-292
  
• Pablo A. Parrilo:
  Semidefinite programming relaxations for semialgebraic problems. 293-320
  
• Ralph E. Gomory, Ellis L. Johnson, Lisa Evans:
  Corner Polyhedra and their connection with cutting planes. 321-339
  
• Ralph E. Gomory, Ellis L. Johnson:
  T-space and cutting planes. 341-375
  
• Julián Aráoz, Lisa Evans, Ralph E. Gomory, Ellis L. Johnson:
  Cyclic group and knapsack facets. 377-408
  

Volume 96, Number 3, June 2003

• S. H. Schmieta, Farid Alizadeh:
  Extension of primal-dual interior point algorithms to symmetric cones. 409-438
  
• Ismael R. de Farias Jr., George L. Nemhauser:
  A polyhedral study of the cardinality constrained knapsack problem. 439-467
  
• Teemu Pennanen, Benar Fux Svaiter:
  Solving monotone inclusions with linear multi-step methods. 469-487
  
• Yaroslav D. Sergeyev, Paolo Pugliese, Domenico Famularo:
  Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints. 489-512
  
• Mikhail V. Solodov:
  Convergence rate analysis of iteractive algorithms for solving variational inequality problems. 513-528
  
• Javier M. Moguerza, Francisco J. Prieto:
  Combining search directions using gradient flows. 529-559
  
• Jacek Gondzio, Robert Sarkissian:
  Parallel interior-point solver for structured linear programs. 561-584