![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Operations Research Letters, Volume 23
Volume 23, Numbers 1-2, 1 August 1998
- Nilotpal Chakravarti, Albert P. M. Wagelmans
:
Calculation of stability radii for combinatorial optimization problems. 1-7 - Petra Schuurman:
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays. 9-11 - Eddie Cheng
:
Separating subdivision of bicycle wheel inequalities over cut polytopes. 13-19 - Geir Dahl
:
The 2-hop spanning tree problem. 21-26 - P. T. Sokkalingam, Yash P. Aneja:
Lexicographic bottleneck combinatorial problems. 27-33 - Diego Klabjan, George L. Nemhauser, Craig A. Tovey:
The complexity of cover inequality separation. 35-40 - Gerhard J. Woeginger:
A comment on a minmax location problem. 41-43 - Christian Kanzow, Masao Fukushima:
Solving box constrained variational inequalities by using the natural residual with D-gap function globalization. 45-51 - Jianmin Jiang:
A long-step primal-dual path-following method for semidefinite programming. 53-61 - Wheyming Tina Song, Chien-Chou Su:
A three-class variance swapping technique for simulation experiments. 63-70
Volume 23, Numbers 3-5, October 1998
- Lisa Fleischer, Éva Tardos:
Efficient continuous-time dynamic network flow algorithms. 71-80 - Joost P. Warners, Hans van Maaren:
A two-phase algorithm for solving a class of hard satisfiability problems. 81-88 - Arie M. C. A. Koster
, Stan P. M. van Hoesel, Antoon W. J. Kolen:
The partial constraint satisfaction problem: Facets and lifting theorems. 89-97 - Alessandra Esposito, M. S. Fiorenzo Catalano, Federico Malucelli, Luciano Tarricone:
A new matrix bandwidth reduction algorithm. 99-107 - Chunfu Jia:
Minimizing variation in stochastic flow shop. 109-111 - Jianjun Wen, Donglei Du:
Preemptive on-line scheduling for two uniform processors. 113-116 - Russell D. Meller, Venkat Narayanan, Pamela H. Vance:
Optimal facility layout design. 117-127 - Michael Sherman:
Batch variance estimators for the median of simulation output. 129-134 - Alper Sen, Ömer S. Benli:
Lot streaming in open shops. 135-142 - Tim Coelli:
A multi-stage methodology for the solution of orientated DEA models. 143-149 - Bingsheng He, Hai Yang:
Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities. 151-161 - Leonid Churilov, Daniel Ralph, Moshe Sniedovich:
A note on composite concave quadratic programming. 163-169 - Hong Chen, Hanqin Zhang:
Diffusion approximations for Kumar-Seidman network under a priority service discipline. 171-181
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.