Mathematical Programming, Volume 102

Volume 102, Number 1, January 2005

• Gongyun Zhao:
  A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Programming. 1-24
  
• Giuseppe C. Calafiore, Marco C. Campi:
  Uncertain convex programs: randomized solutions and confidence levels. 25-46
  
• Florian A. Potra:
  The Kantorovich Theorem and interior point methods. 47-70
  
• Emilie Danna, Edward Rothberg, Claude Le Pape:
  Exploring relaxation induced neighborhoods to improve MIP solutions. 71-90
  
• Shabbir Ahmed, Yongpei Guan:
  The inverse optimal value problem. 91-110
  
• Hiroshi Yamashita, Hiroshi Yabe, Takahito Tanabe:
  A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization. 111-151
  
• Roxin Zhang:
  Weakly upper Lipschitz multifunctions and applications in parametric optimization. 153-166
  
• Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
  Greedy splitting algorithms for approximating multiway partition problems. 167-183
  
• Frederik Stork, Marc Uetz:
  On the generation of circuits and minimal forbidden sets. 185-203
  
• Frederik Stork, Marc Uetz:
  On the generation of circuits and minimal forbidden sets. 205
  

Volume 102, Number 2, March 2005

• Fabián A. Chudak, David P. Williamson:
  Improved approximation algorithms for capacitated facility location problems. 207-222
  
• Liqun Qi, Alexander Shapiro, Chen Ling:
  Differentiability and semismoothness properties of integral functions and their applications. 223-248
  
• Friedrich Eisenbrand, Sören Laue:
  A linear algorithm for integer programming in the plane. 249-259
  
• Arkadi Nemirovski, Levent Tunçel:
  "Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods. 261-294
  
• Ivo Nowak:
  Lagrangian decomposition of block-separable mixed-integer all-quadratic programs. 295-312
  
• Justo Puerto, Arie Tamir:
  Locating tree-shaped facilities using the ordered median objective. 313-338
  
• Akihisa Tamura:
  Coordinatewise domain scaling algorithm for M-convex function minimization. 339-354
  
• Ramkumar Ramaswamy, James B. Orlin, Nilopal Chakravarti:
  Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs. 355-369
  
• Martine Labbé, Hande Yaman, Éric Gourdin:
  A branch and cut algorithm for hub location problems with single assignment. 371-405
  

Volume 102, Number 3, April 2005

• Aharon Ben-Tal, Arkadi Nemirovski:
  Non-euclidean restricted memory level method for large-scale convex optimization. 407-456
  
• Kent Andersen, Gérard Cornuéjols, Yanjun Li:
  Split closure and intersection cuts. 457-493
  
• Glencora Borradaile, Pascal Van Hentenryck:
  Safe and tight linear estimators for global optimization. 495-517
  
• Steven S. Seiden, Gerhard J. Woeginger:
  The two-dimensional cutting stock problem revisited. 519-530
  
• Dieter Vandenbussche, George L. Nemhauser:
  A polyhedral study of nonconvex quadratic programs with box constraints. 531-557
  
• Dieter Vandenbussche, George L. Nemhauser:
  A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. 559-575
  
• Philippe Meurdesoif:
  Strengthening the Lovász Theta(G) bound for graph coloring. 577-588
  
• Miguel F. Anjos:
  An improved semidefinite programming relaxation for the satisfiability problem. 589-608
  
• Chee-Khian Sim, Gongyun Zhao:
  A note on treating a second order cone program as a special case of a semidefinite program. 609-613
  

Last update Mon May 20 18:13:39 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page