Works matching IS 0364765X AND DT 2017 AND VI 42 AND IP 1
Results: 14
Robust Optimization of Credit Portfolios.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 30, doi. 10.1287/moor.2016.0790
- By:
- Publication type:
- Article
Constructing New Weighted ℓ<sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 57, doi. 10.1287/moor.2016.0791
- By:
- Publication type:
- Article
When Is a Network Epidemic Hard to Eliminate?
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 1, doi. 10.1287/moor.2016.0792
- By:
- Publication type:
- Article
Genericity Results in Linear Conic Programming-A Tour d'Horizon.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 77, doi. 10.1287/moor.2016.0793
- By:
- Publication type:
- Article
Empirical Distribution of Equilibrium Play and Its Testing Application.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 15, doi. 10.1287/moor.2016.0794
- By:
- Publication type:
- Article
Computing B-Stationary Points of Nonsmooth DC Programs.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 95, doi. 10.1287/moor.2016.0795
- By:
- Publication type:
- Article
Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 119, doi. 10.1287/moor.2016.0796
- By:
- Publication type:
- Article
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 135, doi. 10.1287/moor.2016.0797
- By:
- Publication type:
- Article
Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 144, doi. 10.1287/moor.2016.0798
- By:
- Publication type:
- Article
Characterizations of Smooth Ambiguity Based on Continuous and Discrete Data.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 167, doi. 10.1287/moor.2016.0799
- By:
- Publication type:
- Article
A Strongly Polynomial Algorithm for Generalized Flow Maximization.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 179, doi. 10.1287/moor.2016.0800
- By:
- Publication type:
- Article
Inventory Control for Spectrally Positive Lévy Demand Processes.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 212, doi. 10.1287/moor.2016.0801
- By:
- Publication type:
- Article
A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 238, doi. 10.1287/moor.2016.0802
- By:
- Publication type:
- Article
Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 1, p. 256, doi. 10.1287/moor.2016.0805
- By:
- Publication type:
- Article