Journals in DBLP
D. Burton , Philippe L. Toint On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:1-22 [Journal ] Dimitris Bertsimas , James B. Orlin A technique for speeding up the solution of the Lagrangean dual. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:23-45 [Journal ] J. Scott Provan Efficient enumeration of the vertices of polyhedra associated with network LP's. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:47-64 [Journal ] Kelly T. Au , Julia L. Higle , Suvrajeet Sen Inexact subgradient methods with applications in stochastic programming. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:65-82 [Journal ] J. B. G. Frenk , Joaquim A. S. Gromicho , Shuzhong Zhang A deep cut ellipsoid algorithm for convex programming: Theory and applications. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:83-108 [Journal ] B. M. Glover , Vaithilingam Jeyakumar , W. Oettli A Farkas lemma for difference sublinear systems and quasidifferentiable programming. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:109-125 [Journal ] Richard H. Byrd , Jorge Nocedal , Robert B. Schnabel Representations of quasi-Newton matrices and their use in limited memory methods. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:129-156 [Journal ] Michel X. Goemans The Steiner tree polytope and related polyhedra. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:157-182 [Journal ] François Margot , A. Prodon , Thomas M. Liebling Tree polytope on 2-trees. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:183-191 [Journal ] Aharon Ben-Tal , Gideon Eiger , Vladimir Gershovitz Global minimization by reducing the duality gap. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:193-212 [Journal ] Ryôhei Nozawa Examples of max-flow and min-cut problems with duality gaps in continuous networks. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:213-234 [Journal ] Hans Kremers , Dolf Talman A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:235-252 [Journal ] Michael Jünger , Alexander Martin , Gerhard Reinelt , Robert Weismantel Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:257-279 [Journal ] Edmund Ihler The rectilinear class Steiner tree problem for intervals on two parallel lines. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:281-296 [Journal ] Jun Dong Cho , Majid Sarrafzadeh The pin redistribution problem in multi-chip modules. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:297-330 [Journal ] Christine Eisenbeis , William Jalby , Daniel Windheiser , François Bodin A strategy for array management in local memory. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:331-370 [Journal ] Shmuel Gal , Yona Hollander , Alon Itai Optimal mapping in direct mapped cache environments. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:371-387 [Journal ]