default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 22
Volume 22, Number 1, February 1997
- Yurii E. Nesterov, Michael J. Todd:
Self-Scaled Barriers and Interior-Point Methods for Convex Programming. 1-42 - Alfred Auslender, Roberto Cominetti
, Mounir Haddou:
Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming. 43-62 - Kurt M. Anstreicher:
On Vaidya's Volumetric Cutting Plane Method for Convex Programming. 63-89 - Andrew V. Goldberg, Alexander V. Karzanov:
Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost. 90-109 - Petra Bauer:
The Circuit Polytope: Facets. 110-145 - Hiroshi Nagamochi, Dao-Zhi Zeng, Naohisa Kabutoya, Toshihide Ibaraki:
Complexity of the Minimum Base Game on Matroids. 146-164 - Jean-Yves Jaffray, Fabrice Philippe:
On the Existence of Subjective Upper and Lower Probabilities. 165-185 - Paul Glasserman, Tai-Wen Liu:
Corrected Diffusion Approximations for a Multistage Production-Inventory System. 186-201 - William M. McEneaney:
A Robust Control Framework for Option Pricing. 202-221 - Apostolos N. Burnetas, Michael N. Katehakis:
Optimal Adaptive Policies for Markov Decision Processes. 222-255
Volume 22, Number 2, May 1997
- Robert Carr:
Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time. 257-265 - Peter Schuur:
Classification of Acceptance Criteria for the Simulated Annealing Algorithm. 266-275 - Emilio Carrizosa, Eduardo Conde, Manuel Muñoz-Márquez, Justo Puerto:
Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case. 276-290 - Emilio Carrizosa, Eduardo Conde, Manuel Muñoz-Márquez, Justo Puerto:
Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case. 291-300 - Liqun Qi, Houyuan Jiang:
Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations. 301-325 - Krzysztof C. Kiwiel:
Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints. 326-349 - Osman Güler:
Hyperbolic Polynomials and Interior Point Methods for Convex Programming. 350-377 - J. Frédéric Bonnans, Florian A. Potra:
On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems. 378-407 - Jos F. Sturm, Shuzhong Zhang:
On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming. 408-431 - Thomas Yew Sing Lee:
A Closed Form Solution for the Asymmetric Random Polling System with Correlated Levy Input Process. 432-457 - Alexander A. Yushkevich:
The Compactness of a Policy Space in Dynamic Programming Via an Extension Theorem for Carathéodory Functions. 458-467 - Sid Browne:
Survival and Growth with a Liability: Optimal Portfolio Strategies in Continuous Time. 468-493 - Piercesare Secchi:
Stationary Strategies for Recursive Games. 494-512
Volume 22, Number 3, August 1997
- Leslie A. Hall, Andreas S. Schulz, David B. Shmoys, Joel Wein:
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms. 513-544 - Martin E. Dyer, Ravi Kannan:
On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension. 545-549 - Imre Bárány, Shmuel Onn:
Colourful Linear Programming and its Relatives. 550-567 - Thomas L. Magnanti, Georgia Perakis:
Averaging Schemes for Variational Inequalities and Systems of Equations. 568-587 - Eitan Altman, Arie Hordijk, F. M. Spieksma:
Contraction Conditions for Average and α-Discount Optimality in Countable State Markov Games with Unbounded Rewards. 588-618 - Sergiu Hart, Dov Monderer:
Potentials and Weighted Values of Nonatomic Games. 619-630 - Henk Norde, Jos A. M. Potters:
On the Determinateness of m × ∞-Bimatrix Games. 631-638 - Ralf Korn:
Optimal Impulse Control When Control Actions Have Random Consequences. 639-667 - Xiao Lan Zhang:
Numerical Analysis of American Option Pricing in a Jump-Diffusion Model. 668-690 - Hong Chen, Hanqin Zhang:
Stability of Multiclass Queueing Networks Under FIFO Service Discipline. 691-725 - Alexander J. Zaslavski, Arie Leizarowitz:
Optimal Solutions of Linear Control Systems with Nonperiodic Convex Integrands. 726-746 - L. R. Huang, K. F. Ng:
On Lower Bounds of the Second-Order Directional Derivatives of Ben-Tal, Zowe, and Chaney. 747-753 - Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos, Motakuri V. Ramana:
Continuous Characterizations of the Maximum Clique Problem. 754-768
Volume 22, Number 4, November 1997
- Sharon Filipowski:
On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data. 769-792 - Donald Goldfarb, Zhiying Jin, James B. Orlin:
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem. 793-802 - Satoru Iwata, Kazuo Murota, Maiko Shigeno:
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences. 803-813 - Ran El-Yaniv, Richard M. Karp:
Nearly Optimal Competitive Online Replacement Policies. 814-839 - Murat Alanyali, Bruce E. Hajek:
Analysis of Simple Algorithms for Dynamic Load Balancing. 840-871 - Alfred Müller:
How Does the Value Function of a Markov Decision Process Depend on the Transition Probabilities? 872-885 - Carlos Humes Jr., J. Ou, P. R. Kumar:
The Delay of Open Markovian Queueing Networks: Uniform Functional Bounds, Heavy Traffic Pole Multiplicities, and Stability. 921-954 - Rafael Amer, Francesc Carreras:
Cooperation Indices and Weighted Shapley Values. 955-968 - Masayuki Shida, Susumu Shindoh, Masakazu Kojima:
Centers of Monotone Generalized Complementarity Problems. 969-976 - Jane J. Ye, X. Y. Ye:
Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints. 977-997 - Jean-Pierre Crouzeix, Jacques A. Ferland, Constantin Zalinescu:
α-Covex Sets and Strong Quasiconvexity. 998-1022
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-26 00:36 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:
