Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 16
Volume 16, Number 1, February 1991
- Maurice Queyranne, Yaoguang Wang:
Single-Machine Scheduling Polyhedra with Precedence Constraints. 1-20 - Michael G. Monticino:
The Adequacy of Universal Strategies in Analytic Gambling Problems. 21-41 - Matteo Fischetti:
Facets of the Asymmetric Traveling Salesman Polytope. 42-56 - Daryl J. Daley, Tomasz Rolski:
Light Traffic Approximations in Queues. 57-71 - Michel X. Goemans, Dimitris J. Bertsimas:
Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem. 72-89 - William P. Peterson:
A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types. 90-118 - R. Tyrrell Rockafellar, Roger J.-B. Wets:
Scenarios and Policy Aggregation in Optimization Under Uncertainty. 119-147 - Chuangyin Dang:
The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations. 148-161 - Wansoo T. Rhee:
Stochastic Analysis of a Modified First Fit Decreasing Packing. 162-175 - Costas Courcoubetis, Uriel G. Rothblum:
On Optimal Packing of Randomly Arriving Objects. 176-194 - Keith W. Ross, Ravi Varadarajan:
Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach. 195-207 - Hans Schneider, Michael H. Schneider:
Max-Balancing Weighted Directed Graphs and Matrix Scaling. 208-222
Volume 16, Number 2, May 1991
- Wansoo T. Rhee:
Stochastic Analysis of the Quadratic Assignment Problem. 223-239 - Alfred Auslender, Roberto Cominetti
:
A Comparative Study of Multifunction Differentiability with Applications in Mathematical Programming. 240-258 - Sylvia C. Boyd, William H. Cunningham:
Small Travelling Salesman Polytopes. 259-271 - Robert E. Tarjan:
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem. 272-291 - Stephen M. Robinson:
An Implicit-Function Theorem for a Class of Nonsmooth Functions. 292-309 - Dan Bienstock:
Some Generalized Max-Flow Min-Cut Problems in the Plane. 310-333 - Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu:
On the Number of Iterations of Piyavskii's Global Optimization Algorithm. 334-350 - Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos:
Combinatorial Algorithms for the Generalized Circulation Problem. 351-381 - George L. O'Brien, Marco Scarsini:
Multivariate Stochastic Dominance and Moments. 382-389 - Lakshman S. Thakur:
Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron. 390-407 - Hong Chen, Avi Mandelbaum:
Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations. 408-446
Volume 16, Number 3, August 1991
- Hans Peters, Eric van Damme:
Characterizing the Nash and Raiffa Bargaining Solutions by Disagreement Point Axioms. 447-461 - Paul Tseng, Dimitri P. Bertsekas:
Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints. 462-481 - Wansoo T. Rhee:
On the Fluctuations of the Stochastic Traveling Salesperson Problem. 482-489 - Wansoo T. Rhee, Michel Talagrand:
Multidimensional Optimal Bin Packing with Items of Random Size. 490-503 - Peter L. Jackson, Robin O. Roundy:
Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints. 504-533 - Refael Hassin, Nimrod Megiddo:
Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon. 534-546 - Masakiyo Miyazawa:
The Characterization of the Stationary Distribution of the Supplemented Self-Clocking Jump Process. 547-565 - Kazuya Kamiya:
Efficient Algorithms for Solving Systems of Nonlinear Equations with a Block Diagonal Structure. 566-579 - Dimitri P. Bertsekas, John N. Tsitsiklis:
An Analysis of Stochastic Shortest Path Problems. 580-595 - John P. Lehoczky, Suresh P. Sethi, H. Mete Soner, Michael I. Taksar:
An Asymptotic Analysis of Hierarchical Control of Manufacturing Systems Under Uncertainty. 596-608 - Kazuya Kamiya, A. J. J. Talman:
Simplicial Algorithm to Find Zero Points of a Function with Special Structure on a Simplotope. 609-626 - Christian Hess:
Convergence of Conditional Expectations for Unbounded Random Sets, Integrands, and Integral Functionals. 627-649 - Julia L. Higle, Suvrajeet Sen:
Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse. 650-669
Volume 16, Number 4, November 1991
- Michael J. Todd:
Probabilistic Models for Linear Programming. 671-693 - Jean-François Mertens:
Stable Equilibria - A Reformulation. Part II. Discussion of the Definition, and Further Results. 694-753 - Masakazu Kojima, Nimrod Megiddo, Toshihito Noma:
Homotopy Continuation Methods for Nonlinear Complementarity Problems. 754-774 - Robert M. Freund, Kok-Choon Tan:
A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming. 775-801 - Wendell H. Fleming, Thaleia Zariphopoulou:
An Optimal Investment/Consumption Model with Borrowing. 802-822 - Ben G. Fitzpatrick, Wendell H. Fleming:
Numerical Methods for an Optimal Investment-Consumption Model. 823-841 - Renato D. C. Monteiro:
Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming. 842-858 - Paul Tseng:
Relaxation Method for Large Scale Linear Programming Using Decomposition. 859-880 - Michel Talagrand:
Complete Convergence of the Directed TSP. 881-887 - Patrick L. Brockett, Abraham Charnes:
Information Theoretic Approach to Geometric Programming. 888-889
a service of 
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-04-22 20:02 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
