default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 26
Volume 26, Number 1, February 2001
- Manfred Padberg:
Almost Perfect Matrices and Graphs. 1-18 - William J. Cook, Sanjeeb Dash:
On the Matrix-Cut Rank of Polyhedra. 19-30 - S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma:
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths. 31-49 - Jean-Luc Prigent
:
Option Pricing with a General Marked Point Process. 50-66 - Horst Zank:
Cumulative Prospect Theory for Parametric and Multiattribute Utilities. 67-81 - Luciano Méndez-Naya:
On the Value of Some Infinite Matrix Games. 82-88 - Annick Laruelle, Federico Valenciano:
Shapley-Shubik and Banzhaf Indices Revisited. 89-104 - Adam B. Levy:
Lipschitzian Multifunctions and a Lipschitzian Inverse Mapping Theorem. 105-118 - Yun-Bin Zhao, Duan Li:
On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems. 119-146 - Edward J. Anderson, Miguel A. Goberna, Marco A. López:
Simplex-Like Trajectories on Quasi-Polyhedral Sets. 147-162 - Vincent Dumas, Philippe Robert:
On the Throughput of a Resource Sharing Model. 163-173 - József Bukszár, András Prékopa:
Probability Bounds with Cherry Trees. 174-192
Volume 26, Number 2, May 2001
- Aharon Ben-Tal, Arkadi Nemirovski:
On Polyhedral Approximations of the Second-Order Cone. 193-205 - Javier Peña:
Conditioning of Convex Programs from a Primal-Dual Perspective. 206-220 - Paul Tseng:
An epsilon-out-of-Kilter Method for Monotropic Programming. 221-233 - Levent Tunçel, Song Xu:
On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping. 234-247 - Heinz H. Bauschke, Patrick L. Combettes:
A Weak-to-Strong Convergence Principle for Fejé-Monotone Methods in Hilbert Spaces. 248-264 - Eilon Solan, Nicolas Vieille:
Quitting Games. 265-285 - Jean-Michel Coulomb:
Absorbing Games with a Signalling Structure. 286-303 - Alexander Bockmayr, Friedrich Eisenbrand:
Cutting Planes and the Elementary Closure in Fixed Dimension. 304-312 - John C. Gittins, Gavin Harper:
Bounds on The Performance of a Greedy Algorithm for Probabilities. 313-323 - Klaus Jansen, Lorant Porkolab:
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. 324-338 - C. P. M. van Hoesel, Albert P. M. Wagelmans:
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems. 339-357 - Benjamin Avi-Itzhak, Hanoch Levy:
Buffer Requirements and Server Ordering in a Tandem Queue with Correlated Service Times. 358-374 - Shane G. Henderson, Peter W. Glynn:
Computing Densities for Markov Chains via Simulation. 375-400 - Nicole Bäuerle:
Discounted Stochastic Fluid Programs. 401-420 - Lisa A. Korf, Roger J.-B. Wets:
Random LSC Functions: An Ergodic Theorem. 421-445
Volume 26, Number 3, August 2001
- Ward Whitt:
The Reflection Map with Discontinuities. 447-484 - A. P. Zwart:
Tail Asymptotics for the Busy Period in the GI/G/1 Queue. 485-493 - Erik J. Balder:
On ws-Convergence of Product Measures. 494-518 - Masakazu Kojima, Akiko Takeda:
Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets. 519-542 - S. H. Schmieta, Farid Alizadeh:
Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones. 543-564 - Oliver Stein:
First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization. 565-582 - Shmuel Onn, Leonard J. Schulman:
The Vector Partition Problem for Convex Objective Functions. 583-590 - Olivier Pereira, Laurence A. Wolsey:
On the Wagner-Whitin Lot-Sizing Polyhedron. 591-600 - Eilon Solan, Rakesh V. Vohra:
Correlated Equilibrium in Quitting Games. 601-610 - John Hillas, Mathijs Jansen, Jos A. M. Potters, Dries Vermeulen:
On the Relation Among Some Definitions of Strategic Stability. 611-635
Volume 26, Number 4, November 2001
- Richard R. Lumley, Mihail Zervos:
A Model for Investments in the Natural Resource Industry with Switching Costs. 637-653 - Alexander Kovalenkov, Myrna Holtz Wooders:
An Exact Bound on Epsilon for Nonemptiness of Epsilon Cores of Games. 654-678 - Bernd Heidergott:
A Differential Calculus for Random Matrices with Applications to (max, +)-Linear Stochastic Systems. 679-699 - Denis Naddef, Yves Pochet:
The Symmetric Traveling Salesman Polytope Revisited. 700-722 - Alfred Müller, Marco Scarsini:
Stochastic Comparison of Random Vectors with a Common Copula. 723-740 - Tito Homem-de-Mello:
Estimation of Derivatives of Nonsmooth Performance Measures in Regenerative Systems. 741-768 - Arkadii V. Kryazhimskii, Andrzej Ruszczynski:
Constraint Aggregation in Infinite-Dimensional Spaces and Applications. 769-795 - Michel X. Goemans, Levent Tunçel:
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? 796-815 - Regina Sandra Burachik, Benar Fux Svaiter:
A Relative Error Tolerance for a Family of Generalized Proximal Point Methods. 816-831 - Jérôme Renault:
Learning Sets in State Dependent Signalling Game Forms: A Characterization. 832-850 - Stefan Scholtes, Michael Stöhr:
How Stringent Is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints? 851-863 - Paolo Ghirardato, Massimo Marinacci:
Risk, Ambiguity, and the Separation of Utility and Beliefs. 864-890
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 2026-07-07 00:48 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
