A+INFORMS Journal on ComputingUTD24202437(1): 125-145Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum AlgorithmsYunsoo Ha, Sara Shashaani, Matt Menickelly被引 5阅读 2基金开放获取人工智能
A+INFORMS Journal on ComputingUTD24202437(6): 1478-1499A Bilevel Optimization Approach for a Class of Combinatorial Problems with Disruptions and ProbingLeonardo Lozano, Juan S. Borrero被引 0阅读 1计算理论与数学不确定性优化（随机/鲁棒/DRO/CVaR）
A+Manufacturing & Service Operations ManagementUTD24FT50201922(4): 700-716Optimizing Day-Ahead Electricity Market Prices: Increasing the Total Surplus for Energy Exchange IstanbulKürşad Derinkuyu, Fehmi Tanrısever, Nermin Elif Kurt, Gökhan Ceyhan被引 18电气与电子工程
A+Operations ResearchUTD24FT50202068(5): 1517-1537Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization AlgorithmsHussein Hazimeh, Rahul Mazumder被引 150阅读 2高影响力 前 1%基金开放获取统计与概率金融风险与机器学习
A+INFORMS Journal on ComputingUTD24202538(3): 878-904SSS Algorithms for Max-CutClaudio Gentile, Giovanni Rinaldi, Esteban Salgado被引 0阅读 2计算理论与数学
A+Operations ResearchUTD24FT50202170(2): 786-804Constrained Assortment Optimization Under the Paired Combinatorial Logit ModelRohan Ghuge, Joseph Sang‐Il Kwon, Viswanath Nagarajan, Adetee Sharma被引 11阅读 1管理信息系统
A+INFORMS Journal on ComputingUTD242021Structured Robust Submodular Maximization: Offline and Online AlgorithmsAlfredo Torrico, Mohit Singh, Sebastian Pokutta, Nika Haghtalab 等 6 人被引 5阅读 2基金开放获取计算理论与数学不确定性优化（随机/鲁棒/DRO/CVaR）
A+Management ScienceUTD24FT50202269(7): 3797-3817Online Learning via Offline Greedy Algorithms: Applications in Market Design and OptimizationRad Niazadeh, Negin Golrezaei, Joshua R. Wang, Fransisca Susan 等 5 人被引 15阅读 4开放获取管理科学与运筹学
A+INFORMS Journal on ComputingUTD242026An Exact Framework for Solving the Space-Time Dependent TSPIsaac Rudich, Manuel López‐Ibáñez, Michael Römer, Quentin Cappart 等 5 人被引 2高影响力 前 10%工业与制造工程
A+INFORMS Journal on ComputingUTD24202234(6): 3292-3308Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time WindowsGonzalo Lera‐Romero, Juan José Miranda‐Bront, Francisco J. Soulignac被引 21阅读 1开放获取工业与制造工程
A+Operations ResearchUTD24FT50202068(3): 741-761Assortment Optimization Under the Paired Combinatorial Logit ModelHeng Zhang, Paat Rusmevichientong, Hüseyin Topaloğlu被引 31高影响力 前 10%管理信息系统
A+INFORMS Journal on ComputingUTD24202133(3): 1197-1212A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound ConstraintsZeyang Wu, Kameng Nip, Qie He被引 5阅读 3数值分析金融风险与机器学习
A+INFORMS Journal on ComputingUTD24202538(2): 548-567Solving Combinatorial Pricing Problems Using Embedded Dynamic Programming ModelsB. Minh, Margarida Carvalho, José Neto被引 2阅读 1基金开放获取计算理论与数学
A+Operations ResearchUTD24FT50202373(2): 986-994Technical Note—Improved Sample-Complexity Bounds in Stochastic OptimizationAlok Baveja, Amit Chavan, Andrei L. Nikiforov, Aravind Srinivasan 等 5 人被引 0阅读 2人工智能
A+Operations ResearchUTD24FT50201866(6): 1661-1669The Approximability of Assortment Optimization Under Ranking PreferencesAli Aouad, Vivek F. Farias, Retsef Levi, Danny Segev被引 113高影响力 前 10%开放获取管理信息系统
A+INFORMS Journal on ComputingUTD24202234(4): 2212-2228Min-Sup-Min Robust Combinatorial Optimization with Few Recourse SolutionsAyşe N. Arslan, Michaël Poss, Marco Silva被引 6阅读 4基金开放获取管理科学与运筹学
A+INFORMS Journal on ComputingUTD24201931(4): 790-804Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound SetsSune Lauth Gadegaard, Lars Relund Nielsen, Matthias Ehrgott被引 25阅读 1开放获取计算理论与数学
A+INFORMS Journal on ComputingUTD24202033(3): 1162-1176A Branch-and-Bound Algorithm for Team Formation on Social NetworksNihal Berktaş, Hande Yaman被引 26基金开放获取管理科学与运筹学
A+Operations ResearchUTD24FT502018395-432其他Heuristic and Metaheuristic Techniques for OptimizationMichael W. Carter, Camille C. Price, Ghaith Rabadi被引 0阅读 1人工智能
A+Operations ResearchUTD24FT50201664(2): 542-559Bayesian Optimization via Simulation with Pairwise Sampling and Correlated Prior BeliefsJing Xie, Peter I. Frazier, Stephen E. Chick被引 50阅读 3高影响力 前 10%管理科学与运筹学
