Journal: Math. Program.

Volume 102, Issue 3

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

Volume 102, Issue 2

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

Volume 102, Issue 1

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