![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Mathematics of Operations Research, Volume 24
Volume 24, Number 1, February 1999
- Tamon Stephen, Levent Tunçel
:
On a Representation of the Matching Polytope Via Semidefinite Liftings. 1-7 - Peter P. Wakker, Horst Zank:
State Dependent Expected Utility for Savage's State Space. 8-34 - Dimitris Alevras:
Small Min-Cut Polyhedra. 35-49 - Roland W. Freund, Florian Jarre, Shinji Mizuno:
Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs. 50-71 - Kazuo Murota, Akiyoshi Shioura:
M-Convex Function on Generalized Polymatroid. 95-105 - Julie A. Ward:
Minimum-Aggregate-Concave-Cost Multicommodity Flows in Strong-Series-Parallel Networks. 106-129 - Lisa Fleischer, Éva Tardos:
Separating Maximally Violated Comb Inequalities in Planar Graphs. 130-148 - Masakazu Muramatsu, Robert J. Vanderbei:
Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming. 149-175 - Kurt M. Anstreicher, Jun Ji, Florian A. Potra, Yinyu Ye:
Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming. 176-192 - Kurt M. Anstreicher:
Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier. 193-203 - Ehud Lehrer, Leeat Yariv:
Repeated Games with Incomplete Information on One Side: The Case of Different Discount Factors. 204-218 - Stephen C. Billups
, Michael C. Ferris
:
Solutions to Affine Generalized Equations Using Proximal Mappings. 219-236 - Krzysztof C. Kiwiel, Torbjörn Larsson
, Per Olov Lindberg:
The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization. 237-254 - M. Seetharama Gowda, Roman Sznajder:
Weak Univalence and Connectedness of Inverse Images of Continuous Functions. 255-261 - Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
Erratum: The Travelling Salesman and the PQ-Tree. 262-272
Volume 24, Number 2, May 1999
- Egon Balas, Matteo Fischetti:
Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem. 273-292 - Christos H. Papadimitriou, John N. Tsitsiklis:
The Complexity of Optimal Queuing Network Control. 293-305 - John L. Bruno, Edward G. Coffman Jr., Jeffrey C. Lagarias, Tom J. Richardson, Peter W. Shor:
Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems. 362-382 - David R. Karger
:
Random Sampling in Cut, Flow, and Network Design Problems. 383-413 - Mark Hartmann, Cristina Arguelles:
Transience Bounds for Long Walks. 414-439 - Ludolf E. Meester, J. George Shanthikumar:
Stochastic Convexity on General Space. 472-494 - Mihail Zervos:
On the Epiconvergence of Stochastic Optimization Problems. 495-508 - Manfred Schäl:
Martingale Measures and Hedging for Discrete-Time Financial Markets. 509-528
Volume 24, Number 3, August 1999
- Steve Alpern, Anatole Beck:
Asymmetric Rendezvous on the Line Is a Double Linear Search Problem. 604-618 - Bernard De Meyer, Dinah Rosenberg:
"Cav u" and the Dual Game. 619-626 - Jirí V. Outrata:
Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints. 627-644 - Alfred Auslender, Marc Teboulle, Sami Ben-Tiba:
Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels. 645-668 - Eilon Solan
:
Three-Player Absorbing Games. 669-698 - Andreas Fischer
:
Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers. 699-727 - Wojciech Banaszczyk
, Alexander E. Litvak, Alain Pajor, Stanislaw J. Szarek
:
The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces. 728-750 - Xiaotie Deng
, Toshihide Ibaraki, Hiroshi Nagamochi:
Algorithmic Aspects of the Core of Combinatorial Optimization Games. 751-766 - Fabrice Philippe, Gabriel Debs, Jean-Yves Jaffray:
Decision Making with Monotone Lower Probabilities of Infinite Order. 767-784
Volume 24, Number 4, November 1999
- János Flesch, Andrés Perea y Monsuwé:
Repeated Games with Endogenous Choice of Information Mechanisms. 785-794 - Jean-Michel Coulomb:
Generalized "Big-Match". 795-816 - Nicolai N. Pisaruk:
Mean Cost Cyclical Games. 817-828 - Adrian S. Lewis:
Ill-Conditioned Convex Processes and Conic Linear Systems. 829-834 - Michel Denuit, Claude Lefèvre, Sergey Utev:
Stochastic Orderings of Convex/Concave-Type on an Arbitrary Grid. 835-846 - Mark Brown:
Interlacing Eigenvalues in Time Reversible Markov Chains. 847-864 - Xiaotao Huang, Richard F. Serfozo:
Spatial Queueing Processes. 865-886 - J. A. Hoogeveen, Tsuyoshi Kawaguchi:
Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases. 887-910 - Celia A. Glass, Jatinder N. D. Gupta
, Chris N. Potts:
Two-Machine No-Wait Flow Shop Scheduling with Missing Operations. 911-924
![](https://dblp.dagstuhl.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.