default search action
Mathematics of Operations Research, Volume 23
Volume 23, Number 1, February 1998
- Yurii E. Nesterov, Arkadi Nemirovski
:
Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods. 1-38 - Renato D. C. Monteiro, Jong-Shi Pang:
On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems. 39-60 - William H. Cunningham, James F. Geelen:
Integral Solutions of Linear Complementarity Problems. 61-68 - Tomasz Radzik:
Faster Algorithms for the Generalized Network Flow Problem. 69-100 - Miguel Constantino:
Lower Bounds in Lot-Sizing Models: A Polyhedral Study. 101-118 - Renate Garbe, Kevin D. Glazebrook:
Stochastic Scheduling with Priority Classes. 119-144 - David Heath, Sidney Resnick, Gennady Samorodnitsky:
Heavy Tails and Long Range Dependence in On/Off Processes and Associated Fluid Models. 145-165 - Søren Asmussen, David Perry:
An Operational Calculus for Matrix-Exponential Distributions, with Applications to a Brownian (q, Q) Inventory Model. 166-176 - Rainer Buckdahn, Ying Hu:
Pricing of American Contingent Claims with Jump Stock Price and Constrained Portfolios. 177-203 - Georg Ch. Pflug, Andrzej Ruszczynski, Rüdiger Schultz:
On the Glivenko-Cantelli Problem in Stochastic Programming: Linear Recourse and Extensions. 204-220 - Roman Sznajder, M. Seetharama Gowda:
Nondegeneracy Concepts for Zeros of Piecewise Smooth Functions. 221-238 - H. Edwin Romeijn, Robert L. Smith:
Shadow Prices in Infinite-Dimensional Linear Programming. 239-256
Volume 23, Number 2, May 1998
- Edward G. Coffman Jr., Anatolii A. Puhalskii, Martin I. Reiman:
Polling Systems in Heavy Traffic: A Bessel Process Limit. 257-304 - Matthieu Brilman, Jean-Marc Vincent:
On the Estimation of the Throughput for a Class of Stochastic Resources Sharing Systems. 305-321 - Bertrand Guenin:
Perfect and Ideal 0, ±1 Matrices. 322-338 - Gábor Pataki:
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues. 339-358 - Warren P. Adams, Julie Bowers Lassiter, Hanif D. Sherali:
Persistency in 0-1 Polynomial Programming. 359-389 - R. Chandrasekaran, Santosh N. Kabadi, R. Sridhar:
Integer Solution for Linear Complementarity Problem. 390-402 - Chuangyin Dang, Hans van Maaren:
A Simplicial Approach to the Determination of an Integer Point of a Simplex. 403-415 - Irwin E. Schochetman, Robert L. Smith:
Existence and Discovery of Average Optimal Solutions in Deterministic Infinite Horizon Optimization. 416-432 - William P. Cross, H. Edwin Romeijn, Robert L. Smith:
Approximating Extreme Points of Infinite Dimensional Convex Sets. 433-442 - Wu Li, Ivan Singer:
Global Error Bounds for Convex Multifunctions and Applications. 443-462 - Daniel Q. Naiman, Richard E. Stone:
A Homological Characterization of Q-Matrices. 463-478 - Vijay Krishna, Tomas Sjöström:
On the Convergence of Fictitious Play. 479-511
Volume 23, Number 3, August 1998
- Abraham Neyman:
Finitely Repeated Games with Finite Automata. 513-552 - J. Abdou:
Rectangularity and Tightness: A Normal Form Characterization of Perfect Information Extensive Game Forms. 553-567 - S. Ramakrishnan, William D. Sudderth:
Geometric Convergence of Algorithms in Gambling Theory. 568-575 - Wolfgang Stadje:
Level-Crossing Properties of the Risk Process. 576-584 - Damien Lamberton, Huyên Pham, Martin Schweizer:
Local Risk-Minimization Under Transaction Costs. 585-612 - Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
The Travelling Salesman and the PQ-Tree. 613-623 - Celia A. Glass, Chris N. Potts:
Structural Properties of Lot Streaming in a Flow Shop. 624-639 - Esther M. Arkin, Refael Hassin:
On Local Search for Weighted k-Set Packing. 640-648 - Tamás Badics, Endre Boros
Minimization of Half-Products. 649-660 - David Hartvigsen:
A Submodular Optimization Problem with Side Constraints. 661-679 - Emilio Carrizosa
Locating an Undesirable Facility by Generalized Cutting Planes. 680-694 - Antoine Gautier, Frieda Granot, Harry Zheng:
Qualitative Sensitivity Analysis in Monotropic Programming. 695-707 - Levent Tunçel
Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization. 708-718 - James V. Burke, Song Xu:
The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems. 719-734 - Francisco Facchinei, Stefano Lucidi
Convergence to Second Order Stationary Points in Inequality Constrained Optimization. 746-766 - Michael J. Todd:
Erratum: Probabilistic Models for Linear Programming. 767-768
Volume 23, Number 4, November 1998
- Aharon Ben-Tal, Arkadi Nemirovski
Robust Convex Optimization. 769-805 - J. Frédéric Bonnans, Roberto Cominetti
Sensitivity Analysis of Optimization Problems Under Second Order Regular Constraints. 806-831 - Josef Stoer, Martin Wechs, Shinji Mizuno:
High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems. 832-862 - Imre Bárány, Herbert E. Scarf:
Matrices with Identical Sets of Neighbors. 863-873 - Chung-Piaw Teo
The Geometry of Fractional Stable Matchings and Its Applications. 874-891 - Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella:
A General Class of Greedily Solvable Linear Programs. 892-908 - Martin Skutella:
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem. 909-929 - Sushil K. Verma, Maged M. Dessouky:
Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties. 930-943 - Moshe Shaked, Fabio Spizzichino:
Positive Dependence Properties of Conditionally Independent Random Lifetimes. 944-959 - Erik Ordentlich, Thomas M. Cover:
The Cost of Achieving the Best Portfolio in Hindsight. 960-982 - Tamás Solymosi
On Computing the Nucleolus of a Balanced Connected Game. 983-1009 - Eilon Solan
Discounted Stochastic Games. 1010-1021
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-12-15 01:25 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: