Journals in DBLP
Eithan Schweitzer , Mordecai Avriel A Gaussian upper bound for Gaussian multi-stage stochastic linear programs. [Citation Graph (0, 0)][DBLP ] Journal ] N. L. Boland A dual-active-set algorithm for positive semi-definite quadratic programming. [Citation Graph (0, 0)][DBLP ] Journal ] Phan Thien Thach , Hiroshi Konno On the degree and separability of nonconvexity and applications to optimization problems. [Citation Graph (0, 0)][DBLP ] Journal ] Sjur Didrik Flåm , Anatoly S. Antipin Equilibrium programming using proximal-like algorithms. [Citation Graph (0, 0)][DBLP ] Journal ] Tomasz Radzik Fast deterministic approximation for the multicommodity flow problem. [Citation Graph (0, 0)][DBLP ] Journal ] Robert Weismantel On the 0/1 knapsack polytope. [Citation Graph (0, 0)][DBLP ] Journal ] Egon Balas , Matteo Fischetti On the monotonization of polyhedra. [Citation Graph (0, 0)][DBLP ] Journal ] Philippe L. Toint Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints. [Citation Graph (0, 0)][DBLP ] Journal ] Yinyu Ye Complexity analysis of the analytic center cutting plane method that uses multiple cuts. [Citation Graph (0, 0)][DBLP ] Journal ] Michael L. Overton , Henry Wolkowicz Semidefinite Programming. [Citation Graph (0, 0)][DBLP ] Journal ] James B. Orlin A polynomial time primal network simplex algorithm for minimum cost flows. [Citation Graph (0, 0)][DBLP ] Journal ] Farid Alizadeh , Jean-Pierre A. Haeberly , Michael L. Overton Complementarity and nondegeneracy in semidefinite programming. [Citation Graph (0, 0)][DBLP ] Journal ] Motakuri V. Ramana An exact duality theory for semidefinite programming and its complexity implications. [Citation Graph (0, 0)][DBLP ] Journal ] Ronald D. Armstrong , Zhiying Jin A new strongly polynomial dual network simplex algorithm. [Citation Graph (0, 0)][DBLP ] Journal ] P. T. Sokkalingam , Prabha Sharma , Ravindra K. Ahuja A new pivot selection rule for the network simplex algorithm. [Citation Graph (0, 0)][DBLP ] Journal ] Donald Goldfarb , Wei Chen On strongly polynomial dual simplex algorithms for the maximum flow problem. [Citation Graph (0, 0)][DBLP ] Journal ] Pascal Gahinet , Arkadi Nemirovski The Projective Method for solving linear matrix inequalities. [Citation Graph (0, 0)][DBLP ] Journal ] Robert Endre Tarjan Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. [Citation Graph (0, 0)][DBLP ] Journal ] S. Thomas McCormick How to compute least infeasible flows. [Citation Graph (0, 0)][DBLP ] Journal ] Arkadi Nemirovski The long-step method of analytic centers for fractional problems. [Citation Graph (0, 0)][DBLP ] Journal ] Riccardo Cambini , Giorgio Gallo , Maria Grazia Scutellà Flows on hypergraphs. [Citation Graph (0, 0)][DBLP ] Journal ] Alexander V. Karzanov Multiflows and disjoint paths of minimum total cost. [Citation Graph (0, 0)][DBLP ] Journal ] Monique Laurent , Svatopluk Poljak , Franz Rendl Connections between semidefinite relaxations of the max-cut and stable set problems. [Citation Graph (0, 0)][DBLP ] Journal ] Lorenzo Brunetta , Michele Conforti , Giovanni Rinaldi A branch-and-cut algorithm for the equicut problem. [Citation Graph (0, 0)][DBLP ] Journal ] Mehran Mesbahi , George P. Papavassilopoulos A cone programming approach to the bilinear matrix inequality problem and its geometry. [Citation Graph (0, 0)][DBLP ] Journal ] Martin Grötschel , Alexander Martin , Robert Weismantel The Steiner tree packing problem in VLSI design. [Citation Graph (0, 0)][DBLP ] Journal ] Franz Rendl , Henry Wolkowicz A semidefinite framework for trust region subproblems with applications to large scale minimization. [Citation Graph (0, 0)][DBLP ] Journal ] Jonathan Yackel , Robert R. Meyer , Ioannis T. Christou Minimum-perimeter domain assignment. [Citation Graph (0, 0)][DBLP ] Journal ] Alexander Shapiro First and second order analysis of nonlinear semidefinite programs. [Citation Graph (0, 0)][DBLP ] Journal ] Jean-Pierre Crouzeix Pseudomonotone variational inequality problems: Existence of solutions. [Citation Graph (0, 0)][DBLP ] Journal ] Benjamin Jansen , Kees Roos , Tamás Terlaky , Akiko Yoshise Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems. [Citation Graph (0, 0)][DBLP ] Journal ] Dimitris Bertsimas , Xiaodong Luo On the worst case complexity of potential reduction algorithms for linear programming. [Citation Graph (0, 0)][DBLP ] Journal ] Hein Hundal , Frank Deutsch Two generalizations of Dykstra's cyclic projections algorithm. [Citation Graph (0, 0)][DBLP ] Journal ] Ji-Ming Peng Equivalence of variational inequality problems to unconstrained minimization. [Citation Graph (0, 0)][DBLP ] Journal ] Mordechai I. Henig , John T. Buchanan Tradeoff directions in multiobjective optimization problems. [Citation Graph (0, 0)][DBLP ] Journal ] Bernd Sturmfels , Rekha R. Thomas Variation of cost functions in integer programming. [Citation Graph (0, 0)][DBLP ] Journal ] Luigi Grippo , S. Lucidi A globally convergent version of the Polak-Ribière conjugate gradient method. [Citation Graph (0, 0)][DBLP ] Journal ] Eddie Cheng , William H. Cunningham Wheel inequalitites for stable set polytopes. [Citation Graph (0, 0)][DBLP ] Journal ] Renato D. C. Monteiro , Paulo R. Zanjácomo A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming. [Citation Graph (0, 0)][DBLP ] Journal ] 