A+Operations ResearchUTD24FT50201664(6): 1177-1196Strong SOCP Relaxations for the Optimal Power Flow ProblemBurak Kocuk, Santanu S. Dey, X. Andy Sun被引 335阅读 3高影响力 前 1%开放获取电气与电子工程
A+INFORMS Journal on ComputingUTD24201628(4): 645-656Convex Relaxations for Gas Expansion PlanningConrado Borraz-Sánchez, Russell W. Bent, Scott Backhaus, Hassan Hijazi 等 5 人被引 144阅读 3高影响力 前 1%开放获取数值分析
A+INFORMS Journal on ComputingUTD24202335(2): 458-474Solving AC Optimal Power Flow with Discrete Decisions to Global OptimalityKevin-Martin Aigner, Robert Burlacu, Frauke Liers, Alexander Reid Martin被引 12阅读 1电气与电子工程
A+INFORMS Journal on ComputingUTD24202436(3): 884-899Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover InequalitiesXiaoyi Gu, Santanu Subhas Dey, Jean‐Philippe P. Richard被引 0基金开放获取数值分析
A+INFORMS Journal on ComputingUTD24201830(3): 554-569The Vehicle Routing Problem with Floating Targets: Formulation and Solution ApproachesClaudio Gambella, Joe Naoum‐Sawaya, Bissan Ghaddar被引 36阅读 1开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD24202234(3): 1489-1511A Scalable Algorithm for Sparse Portfolio SelectionDimitris Bertsimas, Ryan Cory-Wright被引 56阅读 1高影响力 前 10%开放获取管理科学与运筹学
