A+INFORMS Journal on ComputingUTD24202234(5): 2428-2442Stochastic Planning and Scheduling with Logic-Based Benders DecompositionÖzgün Elçi, John Hooker被引 53阅读 2高影响力 前 10%开放获取管理科学与运筹学不确定性优化（随机/鲁棒/DRO/CVaR）
A+INFORMS Journal on ComputingUTD24202234(3): 1453-1470A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative ProgramsVahid Mahmoodian, Iman Dayarian, Payman Ghasemi Saghand, Yu Zhang 等 5 人被引 10阅读 2数值分析
A+INFORMS Journal on ComputingUTD24202134(2): 1042-1047A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function FittingJohn Alasdair Warwicker, Steffen Rebennack被引 19阅读 2数值分析
A+INFORMS Journal on ComputingUTD24202335(4): 817-843Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and OutlookBahman Naderi, Rubén Ruíz, Vahid Roshanaei被引 109阅读 3高影响力 前 1%工业与制造工程
A+Manufacturing & Service Operations ManagementUTD24FT50202426(6): 2121-2141Adaptive Two-Stage Stochastic Programming with an Analysis on Capacity Expansion Planning ProblemBeste Basciftci, Shabbir Ahmed, Nagi Gebraeel被引 17阅读 2高影响力 前 10%开放获取管理科学与运筹学不确定性优化（随机/鲁棒/DRO/CVaR）
A+INFORMS Journal on ComputingUTD24202134(2): 909-933Branch-and-Bound for Biobjective Mixed-Integer Linear ProgrammingNathan Adelgren, Akshay Gupte被引 5阅读 2基金开放获取计算理论与数学
A+INFORMS Journal on ComputingUTD24202437(4): 977-997Domain-Independent Dynamic Programming and Constraint Programming Approaches for Assembly Line Balancing Problems with SetupsJiachen Zhang, J. Christopher Beck被引 6阅读 2基金开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD24202234(4): 1849-1870An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer ProgramsZachary Steever, Chase C. Murray, Junsong Yuan, Mark H. Karwan 等 5 人被引 4阅读 3开放获取数值分析金融风险与机器学习
A+INFORMS Journal on ComputingUTD242020On Mixed-Integer Programming Formulations for the Unit Commitment ProblemBernard Knueven, James Ostrowski, Jean‐Paul Watson被引 157阅读 5高影响力 前 10%基金开放获取电气与电子工程
A+Production and Operations ManagementUTD24FT50202332(7): 2322-2330On the multiresource flexible job‐shop scheduling problem with arbitrary precedence graphsGregory A. Kasapidis, Stéphane Dauzère‐Pérès, Dimitris C. Paraskevopoulos, Panagiotis P. Repoussis 等 5 人被引 24阅读 1高影响力 前 10%开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD24202033(1): 105-119Polyhedral Results and Branch-and-Cut for the Resource Loading ProblemGuopeng Song, Tamás Kis, Roel Leus被引 3阅读 2开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD24202033(3): 1056-1069An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization ProblemsXiaodi Bai, Jie Sun, Xiaojin Zheng被引 16阅读 3基金开放获取管理科学与运筹学不确定性优化（随机/鲁棒/DRO/CVaR）
A+INFORMS Journal on ComputingUTD24202134(1): 315-332Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders DecompositionHassan Zohali, Bahman Naderi, Vahid Roshanaei被引 34阅读 2工业与制造工程
EM-WoSEuropean Journal of Operational Research2026Branch-and-cut for mixed-integer robust chance-constrained optimization with discrete distributionsDaniela Bernhard, Frauke Liers, Michael Stingl被引 0阅读 3开放获取管理科学与运筹学不确定性优化（随机/鲁棒/DRO/CVaR）
A+INFORMS Journal on ComputingUTD242020Exact Multiple Sequence Alignment by Synchronized Decision DiagramsAmin Hosseininasab, Willem‐Jan van Hoeve被引 5阅读 2分子生物学
A+INFORMS Journal on ComputingUTD24202538(5): 1385-1405Exact MILP Models for Redundancy Allocation with Mixed ComponentsJianguang Feng, Zhilong Chen, Ada Che, Chengbin Chu被引 2阅读 4安全、风险、可靠性与质量
A+INFORMS Journal on ComputingUTD24201830(2): 324-338Efficient Storage of Pareto Points in Biobjective Mixed Integer ProgrammingNathan Adelgren, Pietro Belotti, Akshay Gupte被引 6阅读 3基金开放获取计算理论与数学
A+Operations ResearchUTD24FT50201866(2): 463-486Optimization with Stochastic Preferences Based on a General Class of Scalarization FunctionsNilay Noyan, Gábor Rudolf被引 22阅读 2高影响力 前 10%管理科学与运筹学不确定性优化（随机/鲁棒/DRO/CVaR）
A+INFORMS Journal on ComputingUTD24202336(2): 690-704An Efficient Global Optimal Method for Cardinality Constrained Portfolio OptimizationXu Wei, Jie Tang, Ka Fai Cedric Yiu, Jian Wen Peng被引 6阅读 5基金开放获取管理科学与运筹学
A+INFORMS Journal on ComputingUTD24202134(1): 370-384Combinatorial Heuristics for Inventory Routing ProblemsZiye Tang, Yang Jiao, R. Ravi被引 7阅读 1工业与制造工程
