The SCEAS System
Navigation Menu

Journals in DBLP

Math. Program.
1998, volume: 82, number:

  1. Maurice Queyranne
    Minimizing symmetric submodular functions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:3-12 [Journal]
  2. Harold N. Gabow, Michel X. Goemans, David P. Williamson
    An efficient approximation algorithm for the survivable network design problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:13-40 [Journal]
  3. David R. Karger
    Random sampling and greedy sparsification for matroid optimization problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:41-81 [Journal]
  4. Harold N. Gabow, K. S. Manu
    Packing algorithms for arborescences (and spanning trees) in capacitated graphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:83-109 [Journal]
  5. Michel X. Goemans, Jon M. Kleinberg
    An improved approximation ratio for the minimum latency problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:111-124 [Journal]
  6. Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger
    The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:125-158 [Journal]
  7. Rainer Schrader, Andreas S. Schulz, Georg Wambach
    Base polytopes of series-parallel posets: Linear description and optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:159-173 [Journal]
  8. Leslie A. Hall
    Approximability of flow shop scheduling. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:175-190 [Journal]
  9. Sergey V. Sevastianov, Gerhard J. Woeginger
    Makespan minimization in open shops: A polynomial time approximation scheme. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:191-198 [Journal]
  10. Cynthia A. Phillips, Clifford Stein, Joel Wein
    Minimizing average completion time in the presence of release dates. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:199-223 [Journal]
  11. Arjen P. A. Vestjens
    Scheduling uniform machines on-line requires nondecreasing speed ratios. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:225-234 [Journal]
  12. Jack A. A. van der Veen, Gerhard J. Woeginger, Shuzhong Zhang
    Sequencing jobs that require common resources on a single machine: A solvable case of the TSP. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:235-254 [Journal]
  13. Bo Chen, Chris N. Potts, Vitaly A. Strusevich
    Approximation algorithms for two-machine flow shop scheduling with batch setup times. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:255-271 [Journal]
  14. Han Hoogeveen, Steef L. van de Velde
    Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:273-289 [Journal]
  15. Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
    A modified layered-step interior-point algorithm for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:339-355 [Journal]
  16. Kazuo Murota
    Fenchel-type duality for matroid valuations. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:357-375 [Journal]
  17. Ali Bouaricha, Robert B. Schnabel
    Tensor methods for large sparse systems of nonlinear equations. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:377-400 [Journal]
  18. G. S. R. Murthy, T. Parthasarathy
    Fully copositive matrices. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:401-411 [Journal]
  19. Peter Spellucci
    An SQP method for general nonlinear programs using only equality constrained subproblems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:413-448 [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