default search action
ZOR - Methods and Models of Operations Research, Volume 35
Volume 35, Number 1, January 1991
- János Fülöp:
A finite cutting plane method for facial disjunctive programs. 1-13 - Evan E. Anderson, Yu-Min Chen:
Toward a more general theory of corporate strategy: The integration of information and its technologies. 15-25 - Antoon van den Elzen, A. J. J. Talman:
A procedure for finding Nash equilibria in bi-matrix games. 27-43 - Heinrich Exeler:
Upper bounds for the homogeneous case of a two-dimensional packing problem. 45-59 - Martin Grötschel, Michael Jünger, Gerhard Reinelt:
Optimal control of plotting and drilling machines: A case study. 61-84
Volume 35, Number 2, March 1991
- Christian Jansson, Siegfried M. Rump
:
Rigorous solution of linear programming problems with uncertain data. 87-111 - Karl Heinz Borgwardt, Birgit Tremel:
The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem. 113-149 - Josef Haberl, Christine Nowak, Haro Stettner, Gerald Stoiser, Helge Woschitz:
A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production. 151-166 - Jan Karel Lenstra, F. Gianessi, Richard W. Cottle:
Book reviews. 167-172
Volume 35, Number 3, May 1991
- Johannes Jahn:
Editor's preface. - Jonathan Michael Borwein
, Deming M. Zhuang:
Super efficiency in convex vector optimization. 175-184 - Jerald P. Dauer:
Optimization over the efficient set using an active constraint approach. 185-195 - Siegfried Helbig:
Approximation of the efficient point set by perturbation of the ordering cone. 197-220 - Juan Enrique Martínez-Legaz
:
Characterizations of efficient solutions under polyhedrality assumptions. 221-230 - Tilo Staib:
On necessary and sufficient optimality conditions for multicriterial optimization problems. 231-248 - Christiane Tammer, Klaus Tammer:
Generalization and sharpening of some duality relations for a class of vector optimization problems. 249-265
Volume 35, Number 4, July 1991
- Wolfgang W. Bein, Peter Brucker, Matthias F. M. Stallmann:
A characterization of network representable polymatroids. 267-272 - Frank Werner
:
On the combinatorial structure of the permutation flow shop problem. 273-289 - Horst W. Hamacher:
Book review. 290 - Constantin Zalinescu
:
A result on sets, with applications to vector optimization. 291-298 - Ulrich Betke, Martin Henk
:
Linear programming by minimizing distances. 299-307 - Güther Ruhe:
Book review. 308 - Gert Wanka:
On duality in the vectorial control-approximation problem. 309-320 - Harald Friedrich, Joachim Keßler, Erwin Pesch, Birgit Schildt:
Batch scheduling on parallel units in acrylic-glass production. 321-345 - Rainer E. Burkard, Ulrich Faigle:
Book reviews. 346-349
Volume 35, Number 5, September 1991
- Veijo Kaitala, George Leitmann:
Stabilizing management of fluctuating resources. 351-364 - George Bojadziev:
Management of food-chain systems via Liapunov design control. 365-375 - N. Schmitz:
Book review. 376 - Hans-Joachim Plum:
Optimal monotone hysteretic Markov policies in anM/M/1 queueing model with switching costs and finite time horizon. 377-399 - Güther Ruhe:
Book review. 400 - Huynh The Phung, Pham Huy Dien:
Solving nonsmooth inclusions in the convex case. 401-424 - Bruce Desmond Craven:
An algorithm for minimax. 425-434 - A. M. H. Gerards:
Book review. 435-436
Volume 35, Number 6, November 1991
- T. E. S. Raghavan, Jerzy A. Filar
:
Algorithms for stochastic games - A survey. 437-472 - Ulrich Rieder:
Structural results for partially observed control models. 473-490 - Gerhard Hübner, Manfred Schäl:
Adaptive policy-iteration and policy-value-iteration for discounted Markov decision processes. 491-503 - M. Javad Paknejad, Farrokh Nasri, John F. Affisco:
An analysis of setup cost reduction in a two stage system. 505-532
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.