A+INFORMS Journal on ComputingUTD24202234(3): 1768-1794Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein AmbiguityMeysam Cheramin, Jianqiang Cheng, Ruiwei Jiang, Kai Pan被引 34阅读 5高影响力 前 10%基金开放获取管理科学与运筹学不确定性优化（随机/鲁棒/DRO/CVaR）
A+Management ScienceUTD24FT50202369(7): 4016-4026Fluid Approximations for Revenue Management Under High-Variance DemandYicheng Bai, Omar El Housni, Billy Jin, Paat Rusmevichientong 等 6 人被引 17阅读 3高影响力 前 10%开放获取管理信息系统
A+INFORMS Journal on ComputingUTD24202336(2): 510-525Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation RatioYaoyao Zhang, Chaojie Zhu, Shaojie Tang, Yingli Ran 等 6 人被引 0阅读 4人工智能
EM-WoSEuropean Journal of Operational Research2020286(1): 129-137A common approximation framework for early work, late work, and resource leveling problemsPéter Györgyi, Tamás Kis被引 20阅读 1基金开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD24201628(2): 308-318Approximation of the Quadratic Knapsack ProblemUlrich Pferschy, Joachim Schauer被引 16阅读 2计算理论与数学
A+Operations ResearchUTD24FT50201563(2): 412-427Analysis of MILP Techniques for the Pooling ProblemSantanu Subhas Dey, Akshay Gupte被引 52阅读 6高影响力 前 10%数值分析
A+Operations ResearchUTD24FT50201765(2): 433-445Maximizing a Class of Utility Functions Over the Vertices of a PolytopeAlper Atamtürk, Andrés Gómez被引 23阅读 2计算理论与数学不确定性优化（随机/鲁棒/DRO/CVaR）
A+INFORMS Journal on ComputingUTD24201729(4): 581-596SOCEMO: Surrogate Optimization of Computationally Expensive Multiobjective ProblemsJuliane Müller被引 71阅读 5高影响力 前 10%计算理论与数学
A+INFORMS Journal on ComputingUTD242021Approximation Methods for Multiobjective Optimization Problems: A SurveyArne Herzel, Stefan Ruzika, Clemens Thielen被引 50阅读 2高影响力 前 10%计算理论与数学
A+Management ScienceUTD24FT50202369(11): 6898-6911Approximation Benefits of Policy Gradient Methods with Aggregated StatesDaniel Russo被引 4阅读 3开放获取人工智能
EM-WoSEuropean Journal of Operational Research2021297(1): 203-220Pruning Pareto optimal solutions for multi-objective portfolio asset managementSanyapong Petchrompo, Anupong Wannakrairot, Ajith Kumar Parlikad被引 61高影响力 前 10%基金开放获取计算理论与数学
A+Operations ResearchUTD24FT50202170(2): 893-904Technical Note—Capacitated Assortment Optimization: Hardness and ApproximationAntoine Désir, Vineet Goyal, Jiawei Zhang被引 83阅读 5高影响力 前 10%管理信息系统
A+Operations ResearchUTD24FT50201866(3): 834-848Approximation Algorithms for a Class of Stochastic Selection Problems with Reward and Cost ConsiderationsZohar M.A. Strinka, H. Edwin Romeijn被引 0阅读 4管理科学与运筹学
A+Management ScienceUTD24FT50202471(4): 3384-3404Self-Guided Approximate Linear Programs: Randomized Multi-Shot Approximation of Discounted Cost Markov Decision ProcessesParshan Pakiman, Selvaprabu Nadarajah, Negar Soheili, Qihang Lin被引 4阅读 2计算理论与数学
A+INFORMS Journal on ComputingUTD24202437(6): 1457-1477Exact and Approximate Schemes for Robust Optimization Problems with Decision-Dependent Information DiscoveryRosario Paradiso, Angelos Georghiou, Said Dabia, Denise Tönissen被引 5阅读 3开放获取管理科学与运筹学不确定性优化（随机/鲁棒/DRO/CVaR）
A+INFORMS Journal on ComputingUTD242026Constrained Pricing in Logit-Based Revenue ManagementQian Shao, Tien Mai, Shih-Fen Cheng被引 0阅读 2开放获取管理信息系统
A+INFORMS Journal on ComputingUTD24202336(1): 97-120D-Optimal Data Fusion: Exact and Approximation AlgorithmsYongchun Li, Marcia Fampa, Jon Lee, Feng Qiu 等 6 人被引 8阅读 3基金开放获取计算理论与数学
A+INFORMS Journal on ComputingUTD24201730(1): 124-136Integrated Supply Chain Management via Randomized RoundingLehilton L. C. Pedrosa, Maxim I. Sviridenko被引 0阅读 1计算理论与数学
A+INFORMS Journal on ComputingUTD24202234(6): 3277-3291Robust Adaptive Submodular MaximizationShaojie Tang被引 3阅读 3开放获取管理科学与运筹学
A+Operations ResearchUTD24FT50201866(5): 1321-1345Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit PreferencesAli Aouad, Retsef Levi, Danny Segev被引 52阅读 4高影响力 前 10%开放获取管理信息系统
