default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 22
Volume 22, Number 1, February 1998
- Anuj Mehrotra, Michael A. Trick
:
Cliques and clustering: A combinatorial approach. 1-12 - Vladimir G. Deineko, Gerhard J. Woeginger:
A solvable case of the quadratic assignment problem. 13-17 - Kamlesh Mathur:
An integer-programming-based heuristic for the balanced loading problem. 19-25 - Gordon E. Willmot:
On a class of approximations for ruin and waiting time probabilities. 27-32 - J. David Fuller, Frederic H. Murphy:
On the convergence of the decoupling algorithm for multiperiod equilibrium models. 33-39 - DaeSoo Kim, Won J. Lee:
Optimal coordination strategies for production and marketing decisions. 41-47 - Geir Dahl:
Polytopes related to the linfinity-distance between vectors. 49-54
Volume 22, Numbers 2-3, 1 March 1998
- Pierre Hansen, Nenad Mladenovic, Éric D. Taillard:
Heuristic solution of the multisource Weber problem as a p-median problem. 55-62 - Avital Lann, Gur Mosheiov, Yosef Rinott:
Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps. 63-68 - Fred J. Rispoli:
The monotonic diameter of traveling salesman polytopes. 69-73 - Guo-Hui Lin, En-Yu Yao, Yong He:
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times. 75-81 - Michael Jünger, Stefan Thienel:
Introduction to ABACUS - a branch-and-cut system. 83-95 - Ubaldo M. García-Palomares:
A superlinearly convergent projection algorithm for solving the convex inequality problem. 97-103 - Andrew Lim:
The berth planning problem. 105-110
Volume 22, Numbers 4-5, 1 May 1998
- Fabián A. Chudak, Michel X. Goemans, Dorit S. Hochbaum, David P. Williamson:
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. 111-118 - Bettina Klinz, Gerhard J. Woeginger:
One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs. 119-127 - Michel Balinski, Niousha Shahidi:
A simple approach to the product rate variation problem via axiomatics. 129-135 - Satoru Iwata, Tomomi Matsui, S. Thomas McCormick:
A fast bipartite network flow algorithm for selective assembly. 137-143 - Jos F. Sturm, Shuzhong Zhang:
On the long-step path-following method for semidefinite programming. 145-150 - Jack Brimberg, Reuven Chen, Doron Chen:
Accelerating convergence in the Fermat-Weber location problem. 151-157 - Jonathan Barzilai:
On the decomposition of value functions. 159-170 - Steven S. Seiden:
Randomized online interval scheduling. 171-177 - Matthieu van der Heijden, Ton G. de Kok:
Estimating stock levels in periodic review inventory systems. 179-182
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 2026-09-03 22:39 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
