Journals in DBLP
Maurice Queyranne Minimizing symmetric submodular functions. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:82, n:, pp:3-12 [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Leslie A. Hall Approximability of flow shop scheduling. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:82, n:, pp:175-190 [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Kazuo Murota Fenchel-type duality for matroid valuations. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:82, n:, pp:357-375 [Journal ] 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 ] G. S. R. Murthy , T. Parthasarathy Fully copositive matrices. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:82, n:, pp:401-411 [Journal ] 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 ]