default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Methods of Operations Research, Volume 52
Volume 52, Number 1, September 2000
- Manfred Padberg:
Packing small boxes into a big box. 1-21 - Ulrich Faigle, Walter Kern, Daniël Paulusma
:
Note on the computational complexity of least core concepts for min-cost spanning tree games. 23-38 - Marco Slikker, Anne van den Nouweland:
Communication situations with asymmetric players. 39-56 - Jun-Yi Fu:
Generalized vector quasi-equilibrium problems. 57-64 - Mark Voorneveld, Sofia Grahn, Martin Dufwenberg:
Ideal equilibria in noncooperative multicriteria games. 65-77 - Sonja Peterson:
General batch service disciplines - A product-form batch processing network with customer coalescence. 79-97 - Aziz Moukrim:
Upper bound on the number of processors for scheduling with interprocessor communication delays. 99-113 - Bernd Heidergott:
Analysing sojourn times in queueing networks: A structural approach. 115-132 - Rolando Cavazos-Cadena, Raúl Montes-de-Oca:
Nearly optimal policies in risk-sensitive positive dynamic programming on discrete spaces. 133-167
Volume 52, Number 2, November 2000
- Horst A. Eiselt, Carl-Louis Sandblom:
The bounce algorithm for mathematical programming. 173-183 - X. X. Huang:
Stability in vector-valued and set-valued optimization. 185-193 - Michael J. Best, Jaroslava Hlouskova:
The efficient frontier for bounded assets. 195-212 - Charles S. Tapiero, Assa Birati:
Pension funds insurance individuation. 213-220 - Encarnación Algaba Durán, Jesús Mario Bilbao, Peter Borm, J. J. López:
The position value for union stable systems. 221-236 - Victor J. Baston, Andrej Yu. Garnaev:
On a game in manufacturing. 237-249 - Vito Fragnelli, Ignacio García-Jurado, Luciano Méndez-Naya:
On shortest path games. 251-264 - Rangcheng Jia, Yuanyao Ding:
Nonzero-sum non-stationary discounted Markov game model. 265-270 - Onésimo Hernández-Lerma, Juan González-Hernández:
Constrained Markov control processes in Borel spaces: the discounted case. 271-285 - Xianping Guo, Peng Shi, Weiping Zhu:
A new strong optimality criterion for nonstationary Markov decision processes. 287-306 - Onno J. Boxma, Qing Deng:
Asymptotic behaviour of the tandem queueing system with identical service times at both queues. 307-323 - Wolfgang Espelage, Egon Wanke:
The combinatorial complexity of masterkeying. 325-348
Volume 52, Number 3, December 2000
- Philippe Baptiste:
Batching identical jobs. 355-367 - Peter Brucker, Sigrid Knust, Duncan Roper, Yakov Zinder:
Scheduling UET task systems with concurrency on two parallel identical processors. 369-387 - Christian Prins:
Competitive genetic algorithms for the open-shop scheduling problem. 389-411 - Ulrich Dorndorf, Erwin Pesch, Toàn Phan Huy:
A branch-and-bound algorithm for the resource-constrained project scheduling problem. 413-439 - Klaus Neumann, Hartwig Nübel, Christoph Schwindt:
Active and stable project scheduling. 441-465 - Robert Klein, Armin Scholl:
PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem. 467-488 - Joanna Józefowska, Marek Mika, Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz:
Solving the discrete-continuous project scheduling problem via its discretization. 489-499 - Rolf H. Möhring, Frederik Stork:
Linear preselective policies for stochastic project scheduling. 501-515
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 2024-11-20 20:48 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:
