![](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
Mathematical Methods of Operations Research, Volume 43
Volume 43, Number 1, February 1996
- Peter Brucker, Mikhail Y. Kovalyov
:
Single machine batch scheduling to minimize the weighted number of late jobs. 1-8 - Edward J. Anderson, Malcolm Craig Pullan:
Purification for separated continuous linear programs. 9-33 - Ivan Singer:
On dualities between function spaces. 35-44 - Eitan Altman:
Constrained Markov decision processes with total cost criteria: Occupation measures and primal LP. 45-72 - Richard P. McLean, William W. Sharkey:
Probabilistic value pricing. 73-95 - T. S. S. Srinivasa Rao, U. C. Gupta:
A simple method for computing state probabilities of theM/G/1 andGI/M/1 finite waiting space queues. 97-106 - Karl Nachtigall:
Simultaneous semi-eigenvectors for matrices over an extremal algebra. 107-119 - Abraham Mehrez, Lea Friedman:
The properties of a stochastic optimal sequential strategy for purchasing information in a project selection problem. 121-136 - Dieter Jungnickel, G. Moosmüller:
Book reviews. 137-139
Volume 43, Number 2, June 1996
- Uwe T. Zimmermann:
Discrete optimization. 141-142 - Eberhard Girlich, Michail M. Kovalev:
Classification of polyhedral matroids. 143-159 - Michail M. Kovalev, Dmitri M. Vasilkov:
The canonical order and optimization problems. 161-167 - Vladimir Kotov, Michail M. Kovalev:
Maximum travelling salesman problem. 169-181 - Michael R. Bussieck:
On balanced edge connectivity and applications to some bottleneck augmentation problems in networks. 183-194 - Heidemarie Bräsel, Martina Kleinau:
New steps in the amazing world of sequences and schedules. 195-214 - Thomas Tautenhahn:
On unit time open shops with additional restrictions. 215-231 - Svetlana A. Kravchenko, Yuri N. Sotskov:
Optimal makespan schedule for three jobs on two machines. 233-238 - Ulrich Faigle, Walter Kern, Boris Spieker:
On the communication complexity of t -intersection problems in generalized Boolean algebras. 239-254 - Diethard Pallaschke, C. Schulz:
Book reviews. 255-259
Volume 43, Number 3, October 1996
- H. Benker, A. Hamel, Christiane Tammer:
A proximal point algorithm for control approximation problems - Part I: Theoretical background. 261-280 - Rolando Cavazos-Cadena, Emmanuel Fernández-Gaucherand:
Denumerable controlled Markov chains with strong average optimality criterion: Bounded & unbounded costs. 281-300 - Michael L. Dowling:
An affine scaling algorithm for linear programming problems with inequality constraints. 301-318 - Bruce Desmond Craven, Do Van Luu, Bevil Milton Glover:
Strengthened invex and perturbations. 319-336 - Flemming Christensen, Mikael Lind, Jørgen Tind:
On the nucleolus of NTU-games defined by multiple objective linear programs. 337-352 - Douglas John White:
A homotopy approach for infinite horizon discounted Markov decision processes. 353-372 - Alfred Schöttl
:
A new ordering for point processes. 373-387 - M. Javad Paknejad, Farrokh Nasri, John F. Affisco:
An analysis of setup cost reduction in a two stage system with power investment function. 389-401 - Louis J. Billera:
Book reviews. 402-404
![](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.