Mathematical Programming, Volume 92

Volume 92, Number 1, March 2002

• Sanjeev Arora, Alan M. Frieze, Haim Kaplan:
  A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. 1-36
  
• Stefano Lucidi, Marco Sciandrone, P. Tseng:
  Objective-derivative-free methods for constrained optimization. 37-59
  
• Dimitris Bertsimas, Jay Sethuraman:
  From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective. 61-102
  
• Bingsheng He, Li-Zhi Liao, Deren Han, Hai Yang:
  A new inexact alternating directions method for monotone variational inequalities. 103-118
  
• Lisa Fleischer, Satoru Iwata, S. Thomas McCormick:
  A faster capacity scaling algorithm for minimum cost submodular flow. 119-139
  
• Kaisa Miettinen, Marko M. Mäkelä:
  On generalized trade-off directions in nonconvex multiobjective optimization. 141-151
  
• Eddie Cheng, Sven de Vries:
  Antiweb-wheel inequalities and their separation problems over the stable set polytopes. 153-175
  
• V. Jeyakumar, D. T. Luc, P. N. Tinh:
  Convex composite non-Lipschitz programming. 177-195
  

Volume 92, Number 2, April 2002

• Roman A. Polyak:
  Nonlinear rescaling vs. smoothing technique in convex optimization. 197-235
  
• Denis Naddef, Stefan Thienel:
  Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. 237-255
  
• Denis Naddef, Stefan Thienel:
  Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities. 257-283
  
• Walter D. Morris Jr.:
  Randomized pivot algorithms for P-matrix linear complementarity problems. 285-296
  
• Stefan S. Dantchev:
  Improved sorting-based procedure for integer programming. 297-300
  
• Zili Wu, Jane J. Ye:
  On error bounds for lower semicontinuous functions. 301-314
  
• Alper Atamtürk, Deepak Rajan:
  On splittable and unsplittable flow capacitated network design arc-set polyhedra. 315-333
  
• Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh:
  Polyhedral results for the edge capacity polytope. 335-358
  
• Mihai Anitescu:
  On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy. 359-386
  
• Satoru Fujishige, Satoru Iwata:
  A descent method for submodular function minimization. 387-390
  

Volume 92, Number 3, May 2002

• Paul Armand, Jean Charles Gilbert, Sophie Jan-Jégou:
  A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach. 393-424
  
• Alper Atamtürk:
  On capacitated network design cut-set polyhedra. 425-437
  
• David Avis, Caterina De Simone, Paolo Nobili:
  On the chromatic polynomial of a graph. 439-452
  
• Aharon Ben-Tal, Arkadi Nemirovski:
  Robust optimization - methodology and applications. 453-480
  
• Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
  Componentwise fast convergence in the solution of full-rank systems of nonlinear equations. 481-508
  
• Qiaoming Han, Yinyu Ye, Jiawei Zhang:
  An improved rounding method and semidefinite programming relaxation for graph partition. 509-535
  
• Natalia M. Novikova, Irina I. Pospelova:
  Multicriteria decision making under uncertainty. 537-554
  
• M. J. D. Powell:
  UOBYQA: unconstrained optimization by quadratic approximation. 555-582
  

Last update Sat May 25 20:51:28 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page