default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/mor/mor42.bht:"
download as .bib file
@article{DBLP:journals/mor/Amarante17,
author = {Massimiliano Amarante},
title = {Information and Ambiguity: Toward a Foundation of Nonexpected Utility},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1254--1279},
year = {2017},
url = {https://doi.org/10.1287/moor.2017.0847},
doi = {10.1287/MOOR.2017.0847},
timestamp = {Tue, 28 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Amarante17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/AngelisFF17,
author = {Tiziano De Angelis and
Salvatore Federico and
Giorgio Ferrari},
title = {Optimal Boundary Surface for Irreversible Investment with Stochastic
Costs},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1135--1161},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0841},
doi = {10.1287/MOOR.2016.0841},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/AngelisFF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/AtarS17,
author = {Rami Atar and
Subhamay Saha},
title = {An \emph{{\(\varepsilon\)}}-Nash Equilibrium with High Probability
for Strategic Customers in Heavy Traffic},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {626--647},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0820},
doi = {10.1287/MOOR.2016.0820},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/AtarS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/AverkovKW17,
author = {Gennadiy Averkov and
Jan Kr{\"{u}}mpelmann and
Stefan Weltge},
title = {Notions of Maximality for Integral Lattice-Free Polyhedra: The Case
of Dimension Three},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1035--1062},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0836},
doi = {10.1287/MOOR.2016.0836},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/AverkovKW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BaauerleR17,
author = {Nicole B{\"{a}}uerle and
Ulrich Rieder},
title = {Partially Observable Risk-Sensitive Markov Decision Processes},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1180--1196},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0844},
doi = {10.1287/MOOR.2016.0844},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/BaauerleR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BabichenkoBP17,
author = {Yakov Babichenko and
Siddharth Barman and
Ron Peretz},
title = {Empirical Distribution of Equilibrium Play and Its Testing Application},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {15--29},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0794},
doi = {10.1287/MOOR.2016.0794},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/BabichenkoBP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BauschkeBT17,
author = {Heinz H. Bauschke and
J{\'{e}}r{\^{o}}me Bolte and
Marc Teboulle},
title = {A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order
Methods Revisited and Applications},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {330--348},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0817},
doi = {10.1287/MOOR.2016.0817},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/BauschkeBT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BelomestnyK17,
author = {Denis Belomestny and
Volker Kr{\"{a}}tschmer},
title = {Optimal Stopping Under Probability Distortions},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {806--833},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0828},
doi = {10.1287/MOOR.2016.0828},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/BelomestnyK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BianC17,
author = {Wei Bian and
Xiaojun Chen},
title = {Optimality and Complexity for Constrained Optimization Problems with
Nonconvex Regularization},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1063--1084},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0837},
doi = {10.1287/MOOR.2016.0837},
timestamp = {Tue, 28 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/BianC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BoC17,
author = {Lijun Bo and
Agostino Capponi},
title = {Robust Optimization of Credit Portfolios},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {30--56},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0790},
doi = {10.1287/MOOR.2016.0790},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/BoC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BoC17a,
author = {Lijun Bo and
Agostino Capponi},
title = {Optimal Credit Investment with Borrowing Costs},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {546--575},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0818},
doi = {10.1287/MOOR.2016.0818},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/BoC17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BressaudQ17,
author = {Xavier Bressaud and
Anthony Quas},
title = {Dynamical Analysis of a Repeated Game with Incomplete Information},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1085--1105},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0839},
doi = {10.1287/MOOR.2016.0839},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/BressaudQ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BuchbinderFS17,
author = {Niv Buchbinder and
Moran Feldman and
Roy Schwartz},
title = {Comparing Apples and Oranges: Query Trade-off in Submodular Maximization},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {308--329},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0809},
doi = {10.1287/MOOR.2016.0809},
timestamp = {Wed, 23 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/BuchbinderFS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/ChestnutZ17,
author = {Stephen R. Chestnut and
Rico Zenklusen},
title = {Interdicting Structured Combinatorial Optimization Problems with \{0,
1\}-Objectives},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {144--166},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0798},
doi = {10.1287/MOOR.2016.0798},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/ChestnutZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DavisY17,
author = {Damek Davis and
Wotao Yin},
title = {Faster Convergence Rates of Relaxed Peaceman-Rachford and {ADMM} Under
Regularity Assumptions},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {783--805},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0827},
doi = {10.1287/MOOR.2016.0827},
timestamp = {Thu, 24 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/DavisY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DolinskyS17,
author = {Yan Dolinsky and
H. Mete Soner},
title = {Convex Duality with Transaction Costs},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {448--471},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0811},
doi = {10.1287/MOOR.2016.0811},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/DolinskyS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DrakopoulosOT17,
author = {Kimon Drakopoulos and
Asuman E. Ozdaglar and
John N. Tsitsiklis},
title = {When Is a Network Epidemic Hard to Eliminate?},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {1--14},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0792},
doi = {10.1287/MOOR.2016.0792},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/DrakopoulosOT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DurJS17,
author = {Mirjam D{\"{u}}r and
Bolor Jargalsaikhan and
Georg Still},
title = {Genericity Results in Linear Conic Programming - {A} Tour d'Horizon},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {77--94},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0793},
doi = {10.1287/MOOR.2016.0793},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/DurJS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DuttingGR17,
author = {Paul D{\"{u}}tting and
Vasilis Gkatzelis and
Tim Roughgarden},
title = {The Performance of Deferred-Acceptance Auctions},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {897--914},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0835},
doi = {10.1287/MOOR.2016.0835},
timestamp = {Tue, 28 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/DuttingGR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Engau17,
author = {Alexander Engau},
title = {Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic
Optimization},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {119--134},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0796},
doi = {10.1287/MOOR.2016.0796},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Engau17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/FawziSP17,
author = {Hamza Fawzi and
James Saunderson and
Pablo A. Parrilo},
title = {Equivariant Semidefinite Lifts of Regular Polygons},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {472--494},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0813},
doi = {10.1287/MOOR.2016.0813},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/FawziSP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/FeigenbaumSY17,
author = {Itai Feigenbaum and
Jay Sethuraman and
Chun Ye},
title = {Approximately Optimal Mechanisms for Strategyproof Facility Location:
Minimizing \emph{L\({}_{\mbox{p}}\)} Norm of Costs},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {434--447},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0810},
doi = {10.1287/MOOR.2016.0810},
timestamp = {Thu, 24 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/FeigenbaumSY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/FleschP17,
author = {J{\'{a}}nos Flesch and
Arkadi Predtetchinski},
title = {A Characterization of Subgame-Perfect Equilibrium Plays in Borel Games
of Perfect Information},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1162--1179},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0843},
doi = {10.1287/MOOR.2016.0843},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/FleschP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/FujishigeGHPZ17,
author = {Satoru Fujishige and
Michel X. Goemans and
Tobias Harks and
Britta Peis and
Rico Zenklusen},
title = {Matroids Are Immune to Braess' Paradox},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {745--761},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0825},
doi = {10.1287/MOOR.2016.0825},
timestamp = {Thu, 24 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/FujishigeGHPZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/GamzuS17,
author = {Iftah Gamzu and
Danny Segev},
title = {A Sublogarithmic Approximation for Tollbooth Pricing on Trees},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {377--388},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0803},
doi = {10.1287/MOOR.2016.0803},
timestamp = {Thu, 24 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/GamzuS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/GayonMRS17,
author = {Jean{-}Philippe Gayon and
Guillaume Massonnet and
Christophe Rapine and
Gautier Stauffer},
title = {Fast Approximation Algorithms for the One-Warehouse Multi-Retailer
Problem Under General Cost Structures and Capacity Constraints},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {854--875},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0830},
doi = {10.1287/MOOR.2016.0830},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/GayonMRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/GuptaNR17,
author = {Anupam Gupta and
Viswanath Nagarajan and
R. Ravi},
title = {Approximation Algorithms for Optimal Decision Trees and Adaptive {TSP}
Problems},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {876--896},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0831},
doi = {10.1287/MOOR.2016.0831},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/GuptaNR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/HeTY17,
author = {Bingsheng He and
Min Tao and
Xiaoming Yuan},
title = {Convergence Rate Analysis for the Alternating Direction Method of
Multipliers with a Substitution Procedure for Separable Convex Programming},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {662--691},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0822},
doi = {10.1287/MOOR.2016.0822},
timestamp = {Thu, 09 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/HeTY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/HeYZ17,
author = {Shuangchi He and
Dacheng Yao and
Hanqin Zhang},
title = {Optimal Ordering Policy for Inventory Systems with Quantity-Dependent
Setup Costs},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {979--1006},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0833},
doi = {10.1287/MOOR.2016.0833},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/HeYZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/HeringsP17,
author = {P. Jean{-}Jacques Herings and
Arkadi Predtetchinski},
title = {Best-Response Cycles in Perfect Information Games},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {427--433},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0808},
doi = {10.1287/MOOR.2016.0808},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/HeringsP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/HorstP17,
author = {Ulrich Horst and
Michael Paulsen},
title = {A Law of Large Numbers for Limit Order Books},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1280--1312},
year = {2017},
url = {https://doi.org/10.1287/moor.2017.0848},
doi = {10.1287/MOOR.2017.0848},
timestamp = {Tue, 28 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/HorstP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/HuangK17,
author = {Chien{-}Chung Huang and
Telikepalli Kavitha},
title = {New Algorithms for Maximum Weight Matching and a Decomposition Theorem},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {411--426},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0806},
doi = {10.1287/MOOR.2016.0806},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/HuangK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Iriarte17,
author = {Benjamin Iriarte},
title = {Graph Orientations and Linear Extensions},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1219--1229},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0845},
doi = {10.1287/MOOR.2016.0845},
timestamp = {Tue, 28 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Iriarte17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KeskinZ17,
author = {N. Bora Keskin and
Assaf Zeevi},
title = {Chasing Demand: Learning and Earning in a Changing Environment},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {277--307},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0807},
doi = {10.1287/MOOR.2016.0807},
timestamp = {Thu, 24 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/KeskinZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KlerkLLS17,
author = {Etienne de Klerk and
Jean B. Lasserre and
Monique Laurent and
Zhao Sun},
title = {Bound-Constrained Polynomial Optimization Using Only Elementary Calculations},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {834--853},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0829},
doi = {10.1287/MOOR.2016.0829},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/KlerkLLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Kolokoltsov17,
author = {Vassili Kolokoltsov},
title = {The Evolutionary Game of Pressure (or Interference), Resistance and
Collaboration},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {915--944},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0838},
doi = {10.1287/MOOR.2016.0838},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Kolokoltsov17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KurpiszLM17,
author = {Adam Kurpisz and
Samuli Lepp{\"{a}}nen and
Monaldo Mastrolilli},
title = {On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {135--143},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0797},
doi = {10.1287/MOOR.2016.0797},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/KurpiszLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/LeviRTW17,
author = {Retsef Levi and
Robin Roundy and
Van{-}Anh Truong and
Xinshang Wang},
title = {Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic
Inventory Control Models},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {256--276},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0805},
doi = {10.1287/MOOR.2016.0805},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/LeviRTW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/MinardiS17,
author = {Stefania Minardi and
Andrei Savochkin},
title = {Characterizations of Smooth Ambiguity Based on Continuous and Discrete
Data},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {167--178},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0799},
doi = {10.1287/MOOR.2016.0799},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/MinardiS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/OSullivanV17,
author = {Michael J. O'Sullivan and
Arthur F. Veinott Jr.},
title = {Polynomial-Time Computation of Strong and \emph{n}-Present-Value Optimal
Policies in Markov Decision Chains},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {577--598},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0812},
doi = {10.1287/MOOR.2016.0812},
timestamp = {Wed, 18 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/OSullivanV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/PangRA17,
author = {Jong{-}Shi Pang and
Meisam Razaviyayn and
Alberth Alvarado},
title = {Computing B-Stationary Points of Nonsmooth {DC} Programs},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {95--118},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0795},
doi = {10.1287/MOOR.2016.0795},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/PangRA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/PiaK17,
author = {Alberto Del Pia and
Aida Khajavirad},
title = {A Polyhedral Study of Binary Polynomial Programs},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {389--410},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0804},
doi = {10.1287/MOOR.2016.0804},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/PiaK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/QueyranneT17,
author = {Maurice Queyranne and
Fabio Tardella},
title = {Carath{\'{e}}odory, Helly, and Radon Numbers for Sublattice and
Related Convexities},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {495--516},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0815},
doi = {10.1287/MOOR.2016.0815},
timestamp = {Thu, 24 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/QueyranneT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/RamaswamyB17,
author = {Arunselvan Ramaswamy and
Shalabh Bhatnagar},
title = {A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive
Inclusions},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {648--661},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0821},
doi = {10.1287/MOOR.2016.0821},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/RamaswamyB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Razborov17,
author = {Alexander A. Razborov},
title = {On the Width of Semialgebraic Proofs and Algorithms},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1106--1134},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0840},
doi = {10.1287/MOOR.2016.0840},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Razborov17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/RenaultV17,
author = {J{\'{e}}r{\^{o}}me Renault and
Xavier Venel},
title = {Long-Term Values in Markov Decision Processes and Repeated Games,
and a New Distance for Probability Spaces},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {349--376},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0814},
doi = {10.1287/MOOR.2016.0814},
timestamp = {Thu, 24 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/RenaultV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/SaldiYL17,
author = {Naci Saldi and
Serdar Y{\"{u}}ksel and
Tam{\'{a}}s Linder},
title = {On the Asymptotic Optimality of Finite Approximations to Markov Decision
Processes with Borel Spaces},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {945--978},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0832},
doi = {10.1287/MOOR.2016.0832},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/SaldiYL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/SpeakmanL17,
author = {Emily Speakman and
Jon Lee},
title = {Quantifying Double McCormick},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1230--1253},
year = {2017},
url = {https://doi.org/10.1287/moor.2017.0846},
doi = {10.1287/MOOR.2017.0846},
timestamp = {Tue, 28 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/SpeakmanL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/SubramanianY17,
author = {Ajay Subramanian and
Baozhong Yang},
title = {Optimal Dynamic Risk Taking},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {599--625},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0819},
doi = {10.1287/MOOR.2016.0819},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/SubramanianY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/SukS17,
author = {Tonghoon Suk and
Jinwoo Shin},
title = {Scheduling Using Interactive Optimization Oracles for Constrained
Queueing Networks},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {723--744},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0824},
doi = {10.1287/MOOR.2016.0824},
timestamp = {Thu, 24 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/SukS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/SviridenkoVW17,
author = {Maxim Sviridenko and
Jan Vondr{\'{a}}k and
Justin Ward},
title = {Optimal Approximation for Submodular and Supermodular Optimization
with Bounded Curvature},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1197--1218},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0842},
doi = {10.1287/MOOR.2016.0842},
timestamp = {Tue, 28 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/SviridenkoVW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Vegh17,
author = {L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {A Strongly Polynomial Algorithm for Generalized Flow Maximization},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {179--211},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0800},
doi = {10.1287/MOOR.2016.0800},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Vegh17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/WenR17,
author = {Zheng Wen and
Benjamin Van Roy},
title = {Efficient Reinforcement Learning in Deterministic Systems with Value
Function Generalization},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {762--782},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0826},
doi = {10.1287/MOOR.2016.0826},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/WenR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/WhiteleyK17,
author = {Nick Whiteley and
Nikolas Kantas},
title = {Calculating Principal Eigen-Functions of Non-Negative Integral Kernels:
Particle Approximations and Applications},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1007--1034},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0834},
doi = {10.1287/MOOR.2016.0834},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/WhiteleyK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/YamZ17,
author = {Sheung Chi Phillip Yam and
W. Zhou},
title = {Optimal Liquidation of Child Limit Orders},
journal = {Math. Oper. Res.},
volume = {42},
number = {2},
pages = {517--545},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0816},
doi = {10.1287/MOOR.2016.0816},
timestamp = {Fri, 04 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/YamZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Yamazaki17,
author = {Kazutoshi Yamazaki},
title = {Inventory Control for Spectrally Positive L{\'{e}}vy Demand Processes},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {212--237},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0801},
doi = {10.1287/MOOR.2016.0801},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/Yamazaki17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/YingSK17,
author = {Lei Ying and
R. Srikant and
Xiaohan Kang},
title = {The Power of Slightly More than One Sample in Randomized Load Balancing},
journal = {Math. Oper. Res.},
volume = {42},
number = {3},
pages = {692--722},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0823},
doi = {10.1287/MOOR.2016.0823},
timestamp = {Mon, 02 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/YingSK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Yokoi17,
author = {Yu Yokoi},
title = {A Generalized Polymatroid Approach to Stable Matchings with Lower
Quotas},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {238--255},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0802},
doi = {10.1287/MOOR.2016.0802},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Yokoi17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/ZhaoL17,
author = {Yun{-}Bin Zhao and
Zhi{-}Quan Luo},
title = {Constructing New Weighted \emph{{\(\mathscr{l}\)}}\({}_{\mbox{1}}\)-Algorithms
for the Sparsest Points of Polyhedral Sets},
journal = {Math. Oper. Res.},
volume = {42},
number = {1},
pages = {57--76},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0791},
doi = {10.1287/MOOR.2016.0791},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/ZhaoL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-11-13 23:01 CET from data curated 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:
