default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 36
Volume 36, Number 1, February 2011
- Itai Ashlagi, Dov Monderer, Moshe Tennenholtz:
Simultaneous Ad Auctions. 1-13 - Andreas S. Schulz, Nelson A. Uhan:
Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling. 14-23 - Dimitris Bertsimas, Vineet Goyal, Xu Andy Sun:
A Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization. 24-54 - Jérôme Bolte, Aris Daniilidis
, Adrian S. Lewis:
Generic Optimality Conditions for Semialgebraic Convex Programs. 55-70 - Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang:
Buy-at-Bulk Network Design with Protection. 71-87 - Yichuan Ding, Dongdong Ge, Henry Wolkowicz:
On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming. 88-104 - Xianping Guo, Alexei B. Piunovskiy:
Discounted Continuous-Time Markov Decision Processes with Constraints: Unbounded Transition and Loss Rates. 105-132 - Rolando Cavazos-Cadena, Daniel Hernández-Hernández:
Discounted Approximations for Risk-Sensitive Average Criteria in Markov Decision Chains with Finite State Space. 133-146 - Allise O. Wachs, Irwin E. Schochetman, Robert L. Smith:
Average Optimality in Nonhomogeneous Infinite Horizon Markov Decision Processes. 147-164 - Jane J. Ye:
Necessary Optimality Conditions for Multiobjective Bilevel Programs. 165-184
Volume 36, Number 2, May 2011
- Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità:
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk. 185-204 - Michael Z. Spivey:
Asymptotic Moments of the Bottleneck Assignment Problem. 205-226 - Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma:
The Chvátal-Gomory Closure of a Strictly Convex Body. 227-239 - Mehmet A. Begen, Maurice Queyranne:
Appointment Scheduling with Discrete Random Durations. 240-257 - Ali Eshragh, Jerzy A. Filar:
Hamiltonian Cycles, Random Walks, and Discounted Occupational Measures. 258-270 - Jian Gang Dai, Tolga Tezcan:
State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems. 271-320 - Simone Cerreia-Vioglio, Fabio Maccheroni, Massimo Marinacci, Luigi Montrucchio:
Complete Monotone Quasiconcave Duality. 321-339 - Teemu Pennanen:
Convex Duality in Stochastic Optimization and Mathematical Finance. 340-362 - Pui Chan Lon, Mihail Zervos:
A Model for Optimally Advertising and Launching a Product. 363-376
Volume 36, Number 3, August 2011
- Chin How Jeffrey Pang:
Generalized Differentiation with Positively Homogeneous Maps: Applications in Set-Valued Analysis and Metric Regularity. 377-397 - Jiawang Nie:
Polynomial Matrix Inequality and Semidefinite Representation. 398-415 - Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko:
Tight Approximation Algorithms for Maximum Separable Assignment Problems. 416-431 - Santanu S. Dey, Quentin Louveaux:
Split Rank of Triangle and Quadrilateral Inequalities. 432-461 - Benjamin Nill, Günter M. Ziegler:
Projecting Lattice Polytopes Without Interior Lattice Points. 462-467 - Roger A. Purves, William D. Sudderth:
Perfect Information Games with Upper Semicontinuous Payoffs. 468-473 - Ozan Candogan, Ishai Menache, Asuman E. Ozdaglar, Pablo A. Parrilo:
Flows and Decompositions of Games: Harmonic and Potential Games. 474-503 - Daniel Ralph, Oliver Stein:
The C-Index: A New Stability Concept for Quadratic Programs with Complementarity Constraints. 504-526 - Eunji Lim:
On the Convergence Rate for Stochastic Approximation in the Nonsmooth Setting. 527-537 - Lukasz Kruk:
An Open Queueing Network with Asymptotically Stable Fluid Model and Unconventional Heavy Traffic Behavior. 538-551 - Yusuke Kamishiro, Roberto Serrano:
Equilibrium Blocking in Large Quasilinear Economies. 552-567 - Daniel Ralph, Huifu Xu:
Convergence of Stationary Points of Sample Average Two-Stage Stochastic Programs: A Generalized Equation Approach. 568-592
Volume 36, Number 4, November 2011
- Yinyu Ye:
The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate. 593-603 - Mou-Hsiung Chang, Tao Pang, Yipeng Yang:
A Stochastic Portfolio Optimization Model with Bounded Memory. 604-619 - Philip H. Dybvig, Hong Liu:
Verification Theorems for Models of Optimal Consumption and Investment with Retirement and Constrained Borrowing. 620-635 - Xiaotie Deng, Qi Qi, Amin Saberi, Jie Zhang:
Discrete Fixed Points: Models, Complexities, and Applications. 636-652 - Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
On the Approximability of Single-Machine Scheduling with Precedence Constraints. 653-669 - Yongchao Liu, Huifu Xu, Jane J. Ye:
Penalized Sample Average Approximation Methods for Stochastic Mathematical Programs with Complementarity Constraints. 670-694 - Ying-Ju Chen:
Optimal Selling Scheme for Heterogeneous Consumers with Uncertain Valuations. 695-720 - Gennadiy Averkov, Christian Wagner, Robert Weismantel:
Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three. 721-742 - Klaus Jansen, Roberto Solis-Oba:
A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths. 743-753 - Santosh N. Kabadi, Abraham P. Punnen:
An O(n4) Algorithm for the QAP Linearization Problem. 754-761 - Gagan Goel, Vijay V. Vazirani:
A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for It. 762-782
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-01-30 23:01 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:
