default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 12
Volume 12, Number 1, February 1987
- Liqun Qi:
The A-Forest Iteration Method for the Stochastic Generalized Transportation Problem. 1-21 - Clyde L. Monma, Jeffrey B. Sidney:
Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions. 22-31 - Andrzej Ruszczynski:
A Linearization Method for Nonsmooth Stochastic Programming Problems. 32-49 - Paul D. Domich, R. Kannan, Leslie E. Trotter Jr.:
Hermite Normal Form Computation Using Modulo Determinant Arithmetic. 50-59 - Harald Benzing, Michael Kolonko:
Structured Policies for a Sequential Design Problem with General Distributions. 60-71 - Klaus Truemper:
Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes. 72-96 - W. Cook, William R. Pulleyblank:
Linear Systems for Constrained Matching Problems. 97-120 - James Renegar:
On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials. 121-148 - John R. Birge
, Roger J.-B. Wets:
Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem. 149-162 - Arie Hordijk, Martin L. Puterman:
On the Convergence of Policy Iteration in Finite State Undiscounted Markov Decision Processes: The Unichain Case. 163-176 - Wansoo T. Rhee, Michel Talagrand:
Martingale Inequalities and NP-Complete Problems. 177-181 - Martin Grötschel, William R. Pulleyblank:
Corrigenda: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem. 182-184
Volume 12, Number 2, May 1987
- Ezra Einy:
Semivalues of Simple Games. 185-192 - Michele Conforti, M. R. Rao:
Some New Matroids on Graphs: Cut Sets and the Max Cut Problem. 193-204 - Kevin D. Glazebrook:
Sensitivity Analysis for Stochastic Scheduling Problems. 205-223 - Aharon Ben-Tal, Marc Teboulle:
Penalty Functions and Duality in Stochastic Programming Via ϕ-Divergence Functionals. 224-240 - J. B. G. Frenk, A. H. G. Rinnooy Kan:
The Asymptotic Optimality of the LPT Rule. 241-254 - Zvi Drezner, Saharon Shelah:
On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem. 255-261 - Michael N. Katehakis, Arthur F. Veinott Jr.:
The Multi-Armed Bandit Problem: Decomposition and Computation. 262-268 - William S. Lovejoy:
Ordered Solutions for Dynamic Programs. 269-276 - Yoshio Ohtsubo:
A Nonzero-Sum Extension of Dynkin's Stopping Problem. 277-296 - Emmanuel Nicholas Barron, Robert Jensen, A. G. Malliaris:
Minimizing a Quadratic Payoff with Monotone Controls. 297-308 - Joachim Rosenmüller:
Homogeneous Games: Recursive Structure and Computation. 309-330 - Garth P. McCormick:
Verification of High Order Optimality Conditions Using the Polyadic Representation of Derivatives. 331-339 - Arie Tamir:
On the Solution Value of the Continuous p-Center Location Problem on a Graph. 340-349 - William A. Massey:
Stochastic Orderings for Markov Processes on Partially Ordered Spaces. 350-367 - Cu Duong Ha:
Application of Degree Theory in Stability of the Complementarity Problem. 368-376
Volume 12, Number 3, August 1987
- H. Peyton Young:
On Dividing an Amount According to Individual Claims or Liabilities. 398-414 - Ravi Kannan:
Minkowski's Convex Body Theorem and Integer Programming. 415-440 - Christos H. Papadimitriou, John N. Tsitsiklis:
The Complexity of Markov Decision Processes. 441-450 - Reinhardt Euler, Michael Jünger, Gerhard Reinelt:
Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra. 451-462 - Theodore P. Hill, Jan van der Wal:
Monotonically Improving Limit-Optimal Strategies in Finite-State Decision Processes. 463-473 - Jong-Shi Pang:
A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality Problem. 474-484 - T. M. Doup, A. J. J. Talman:
A Continuous Deformation Algorithm on the Product Space of Unit Simplices. 485-521 - Egon Balas, Vasek Chvátal, Jaroslav Nesetril:
On the Maximum Weight Clique Problem. 522-535 - Dov Samet:
Continuous Selections for Vector Measures. 536-543 - Bahman Kalantari, J. Ben Rosen:
An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions. 544-561 - Moshe Shaked, J. George Shanthikumar:
IFRA Properties of Some Markov Jump Processes with General State Space. 562-568
Volume 12, Number 4, November 1987
- Paul Tseng, Dimitri P. Bertsekas:
Relaxation Methods for Linear Programs. 569-596 - King-Tim Mak:
Coherent Continuous Systems and the Generalized Functional Equation of Associativity. 597-625 - Tatsuro Ichiishi:
α-Stable Extensive Game Forms. 626-633 - Ranel E. Erickson, Clyde L. Monma, Arthur F. Veinott Jr.:
Send-and-Split Method for Minimum-Concave-Cost Network Flows. 634-664 - Jewgeni H. Dshalalow:
Infinite Channel Queueing System with Controlled Input. 665-677 - Janice H. Hammond, Thomas L. Magnanti:
Generalized Descent Methods for Asymmetric Systems of Equations. 678-699 - W. H. M. Zijm:
Exponential Convergence in Undiscounted Continuous-Time Markov Decision Chains. 700-717 - Victor Klee, Peter Kleinschmidt:
The d-Step Conjecture and Its Relatives. 718-755
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-11-22 19:33 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:
