The SCEAS System
Navigation Menu

Journals in DBLP

Math. Program.
1993, volume: 60, number:

  1. Paul Tseng, Dimitri P. Bertsekas
    On the convergence of the exponential multiplier method for convex programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:1-19 [Journal]
  2. Gérard Cornuéjols, Farid Harche
    Polyhedral study of the capacitated vehicle routing problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:21-52 [Journal]
  3. Francisco Barahona
    On cuts and matchings in planar graphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:53-68 [Journal]
  4. Jie Sun
    A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:69-79 [Journal]
  5. Jean-Louis Goffin, Jean-Philippe Vial
    On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:81-92 [Journal]
  6. J. E. Martínez-Legaz, S. Romano-Rodríguez
    Lower subdifferentiability of quadratic functions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:93-113 [Journal]
  7. Donald K. Wagner, Hong Wan
    A polynomial-time simplex method for the maximum k-flow problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:115-123 [Journal]
  8. M. L. Balinski, Fred J. Rispoli
    Signature classes of transportation polytopes. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:127-144 [Journal]
  9. Michel X. Goemans, Dimitris Bertsimas
    Survivable networks, linear programming relaxations and the parsimonious property. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:145-166 [Journal]
  10. Dirk Siegel
    Updating of conjugate direction matrices using members of Broyen's family. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:167-185 [Journal]
  11. Gianni Di Pillo, Luigi Grippo, S. Lucidi
    A smooth method for the finite minimax problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:187-214 [Journal]
  12. Osman Güler, Yinyu Ye
    Convergence behavior of interior-point algorithms. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:215-228 [Journal]
  13. Jiri Rohn
    A note on solvability of a class of linear complementarity problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:229-231 [Journal]
  14. Thomas L. Magnanti, Prakash Mirchandani, Rita Vachani
    The convex hull of two core capacitated network design problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:233-250 [Journal]
  15. James B. Orlin, Serge A. Plotkin, Éva Tardos
    Polynomial dual network simplex algorithms. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:255-276 [Journal]
  16. Alexander V. Karzanov, Vasilij N. Lebedev
    Cyclical games with prohibitions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:277-293 [Journal]
  17. Jong-Shi Pang, Steven A. Gabriel
    NE/SQP: A robust algorithm for the nonlinear complementarity problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:295-337 [Journal]
  18. L. Kuntz, Stefan Scholtes
    Constraint qualifications in quasidifferentiable optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:339-347 [Journal]
  19. Michael M. Kostreva, Malgorzata M. Wiecek
    Linear complementarity problems and multiple objective programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:349-359 [Journal]
  20. Olaf E. Flippo, Alexander H. G. Rinnooy Kan
    Decomposition in general mathematical programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:361-382 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002