default search action
Mathematical Programming, Volume 82
Volume 82, 1998
- Maurice Queyranne:
Minimizing symmetric submodular functions. 3-12 - Harold N. Gabow, Michel X. Goemans, David P. Williamson:
An efficient approximation algorithm for the survivable network design problem. 13-40 - David R. Karger
:
Random sampling and greedy sparsification for matroid optimization problems. 41-81 - Harold N. Gabow, K. S. Manu:
Packing algorithms for arborescences (and spanning trees) in capacitated graphs. 83-109 - Michel X. Goemans, Jon M. Kleinberg:
An improved approximation ratio for the minimum latency problem. 111-124 - 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. 125-158 - Rainer Schrader, Andreas S. Schulz, Georg Wambach:
Base polytopes of series-parallel posets: Linear description and optimization. 159-173 - Leslie A. Hall:
Approximability of flow shop scheduling. 175-190 - Sergey V. Sevastianov, Gerhard J. Woeginger:
Makespan minimization in open shops: A polynomial time approximation scheme. 191-198 - Cynthia A. Phillips, Clifford Stein, Joel Wein:
Minimizing average completion time in the presence of release dates. 199-223 - Arjen P. A. Vestjens:
Scheduling uniform machines on-line requires nondecreasing speed ratios. 225-234 - 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. 235-254 - Bo Chen
Approximation algorithms for two-machine flow shop scheduling with batch setup times. 255-271 - Han Hoogeveen, Steef L. van de Velde:
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine. 273-289 - Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya:
A modified layered-step interior-point algorithm for linear programming. 339-355 - Kazuo Murota:
Fenchel-type duality for matroid valuations. 357-375 - Ali Bouaricha, Robert B. Schnabel:
Tensor methods for large sparse systems of nonlinear equations. 377-400 - G. S. R. Murthy, T. Parthasarathy:
Fully copositive matrices. 401-411 - Peter Spellucci:
An SQP method for general nonlinear programs using only equality constrained subproblems. 413-448
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-02 18:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: