default search action
Mathematical Methods of Operations Research, Volume 56
Volume 56, Number 1, August 2002
- Michael Jünger, Rüdiger Schultz, Robert Weismantel:
Preface. 1-2 - Miguel F. Anjos, Anthony Vannelli:
An Attractor-Repeller approach to floorplanning. 3-27 - Robert T. Firla, Bianca Spille, Robert Weismantel:
Exponential irreducible neighborhoods for combinatorial optimization problems. 29-44 - Arie M. C. A. Koster, Adrian Zymolka:
Stable multi-sets. 45-65 - Adam N. Letchford, Andrea Lodi:
Primal cutting plane algorithms revisited. 67-81 - Morten Riis, Jørn Lodahl:
A bicriteria stochastic programming model for capacity expansion in telecommunications. 83-100 - Jens Vygen:
On dual minimum cost flow algorithms. 101-126 - Annegret Katrin Wagler:
Rank-perfect and" weakly rank-perfect graphs. 127-149
Volume 56, Number 2, November 2002
- Tudor M. Stoenescu, Demosthenis Teneketzis:
A pricing methodology for resource allocation and routing in integrated-services networks with quality of service requirements. 151-167 - Kuo-Hsiung Wang, Ying-Chung Chang:
Cost analysis of a finite M/M/R queueing system with balking, reneging, and server breakdowns. 169-180 - Rolando Cavazos-Cadena:
Value iteration and approximately optimal stationary policies in finite-state average Markov decision chains. 181-196 - Hao Cheng, Shu-Cherng Fang, John E. Lavery:
Univariate cubic L1 splines - A geometric programming approach. 197-229 - Liping Zhang, Ziyou Gao:
Superlinear/quadratic one-step smoothing Newton method for P0-NCP without strict complementarity. 231-241 - Ahmed El Kharroubi, Abdelghani Ben Tahar, Abdelhak Yaacoubi:
On the stability of the linear Skorohod problem in an orthant. 243-258 - Jun-Yi Fu, An-Hua Wan:
Generalized vector equilibrium problems with set-valued mappings. 259-268 - Gustavo Bergantiños, Jordi Massó:
The Chi-compromise value for non-transferable utility games. 269-286 - Jesús Mario Bilbao, Theo S. H. Driessen, Andrés Jiménez-Losada, Esperanza A. Lebrón:
The Shapley value for games on matroids: The dynamic model. 287-301 - Agnieszka Rusinowska:
Subgame perfect equilibria in model with bargaining costs varying in time. 303-313 - János Flesch, Frank Thuijsman, O. J. Vrieze:
Optimality in different strategy classes in zero-sum stochastic games. 315-322 - Mark Voorneveld, Sofia Grahn:
Cost allocation in shortest path games. 323-340 - Thomas Hanne:
Book Reviews. 341-342 - Francesco Maffioli:
Book Reviews. 343-344 - Stefan Nickel:
Book Reviews. 345
Volume 56, Number 3, January 2003
- Marc Christian Steinbach:
Tree-sparse convex programs. 347-376 - Yoshio Okamoto:
Some properties of the core on convex geometries. 377-386 - Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Approximation algorithms for the traveling salesman problem. 387-405 - Peter Brucker, Johann L. Hurink, Sigrid Knust:
A polynomial algorithm for P | pj=1, rj, outtree | ∑ Cj. 407-412 - Kathrin Klamroth, Jørgen Tind, Margaret M. Wiecek:
Unbiased approximation in multicriteria optimization. 413-437 - Mark Voorneveld, Stef Tijs, Sofia Grahn:
Monotonic allocation schemes in clan games. 439-449 - Heinz-Uwe Küenle, Ronald Schurath:
The optimality equation and ε-optimal strategies in Markov games with average reward criterion. 451-471 - Rolando Cavazos-Cadena, Daniel Hernández-Hernández:
Solution to the risk-sensitive average optimality equation in communicating Markov decision chains with finite state space: An alternative approach. 473-479 - Peter Bruns:
Optimality of randomized strategies in a Markovian replacement model. 481-499 - R. A. Maller, D. A. Turkington:
New light on the portfolio allocation problem. 501-511 - Klaus Neumann, Christoph Schwindt:
Project scheduling with inventory constraints. 513-533 - M. Teresa Melo:
Book Reviews. 535-536 - Justo Puerto:
Book Reviews. 537-538 - Bettina Klinz:
Book Reviews. 539-540
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.