A+INFORMS Journal on ComputingUTD24202437(4): 785-807An Efficient Node Selection Policy for Monte Carlo Tree Search with Neural NetworksXiaotian Liu, Yijie Peng, Gongbo Zhang, Ruihan Zhou被引 9阅读 1开放获取人工智能
A+INFORMS Journal on ComputingUTD24202234(3): 1345-1365Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set ProblemS. Raghavan, Rui Zhang被引 14计算理论与数学
A+INFORMS Journal on ComputingUTD24202437(3): 644-665Machine Learning for K-Adaptability in Two-Stage Robust OptimizationEsther Julien, Krzysztof Postek, Ş. İlker Birbil被引 2阅读 1管理科学与运筹学不确定性优化（随机/鲁棒/DRO/CVaR）金融风险与机器学习
A+INFORMS Journal on ComputingUTD24202336(1): 61-77D iversi T ree : A New Method to Efficiently Compute Diverse Sets of Near-Optimal Solutions to Mixed-Integer Optimization ProblemsIzuwa Ahanor, Hugh Medal, Andrew Christopher Trapp被引 3阅读 2数值分析
EM-T1Reliability Engineering & System Safety2025265: 111495-111495Resilience analysis and recovery strategy for interdependent automated container port networks under cascading failuresShipeng Wang, Haiyan Wang, Xushi Ma, Yang Han 等 7 人被引 13阅读 4高影响力 前 10%基金开放获取土木与结构工程复合灾害与灾害链
EM-WoSExpert Systems with Applications2027333: 133976A two-stage deep reinforcement learning strategy for shared autonomous vehicles’ pickup and delivery problem with dynamic wireless chargingYunlong Wang, Minh Kieu, Jingwen Li, Prakash Ranjitkar 等 6 人被引 0阅读 1开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD24201932(1): 182-198Convex Optimization for Group Feature Selection in Networked DataDaehan Won, Hasan Manzour, Wanpracha Art Chaovalitwongse被引 14阅读 1统计与概率金融风险与机器学习
A+INFORMS Journal on ComputingUTD242024Code and Data Repository for Machine Learning for K-Adaptability in Two-Stage Robust OptimizationEsther Julien, Krzysztof Postek, Ş. İlker Birbil被引 0阅读 1管理科学与运筹学不确定性优化（随机/鲁棒/DRO/CVaR）金融风险与机器学习
A+INFORMS Journal on ComputingUTD24201628(1): 162-174Robust Critical Node Selection by Benders DecompositionJoe Naoum‐Sawaya, Christoph Buchheim被引 19阅读 2开放获取计算理论与数学不确定性优化（随机/鲁棒/DRO/CVaR）
A+Management ScienceUTD24FT502024Can Random Friends Seed More Buzz and Adoption? Leveraging the Friendship ParadoxVineet Kumar, K. Sudhir被引 6统计与非线性物理
A+INFORMS Journal on ComputingUTD24202033(1): 319-335The Migratory Beekeeping Routing Problem: Model and an Exact AlgorithmZujun Ma, Fei Yang, Ying Dai, Zuo‐Jun Max Shen被引 6阅读 3工业与制造工程
A+INFORMS Journal on ComputingUTD24202538(5): 1289-1306COMET: An Interactive Framework for Efficient and Effective Community Search via Active LearningJiawei Zhou, Kai Wang, Jianwei Wang, Kunpeng Zhang 等 5 人被引 1阅读 2计算机视觉与模式识别金融风险与机器学习
A+INFORMS Journal on ComputingUTD242024Code and Data Repository for An Efficient Node Selection Policy for Monte Carlo Tree Search with Neural NetworksXiaotian Liu, Yijie Peng, Gongbo Zhang, Ruihan Zhou被引 3阅读 1人工智能
A+INFORMS Journal on ComputingUTD24202336(1): 285-304Enhancing Branch-and-Bound for Multiobjective 0-1 ProgrammingNicolas Forget, Sophie N. Parragh被引 6阅读 2基金开放获取计算理论与数学
A+INFORMS Journal on ComputingUTD24202234(6): 3117-3133A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity ProblemsMarianna De Santis, Sven de Vries, Martin Schmidt, Lukas Winkel被引 2阅读 1基金开放获取数值分析
EM-WoSExpert Systems with Applications2027333: 134069Roulette wheel selection driving adaptive expansion of dynamic seed pool for community detectionYang Zhao, Mengxing Huang, Yuanyuan Wu, Kun Deng被引 0阅读 2开放获取统计与非线性物理
EM-WoSInformation Sciences2027760: 124137Cloud continuum node evaluation and selection via mathematical programmingGregory Koronakos, Yiannis Verginadis, Dimitris Apostolou, Gregoris Mentzas被引 0阅读 2开放获取信息系统
A+INFORMS Journal on ComputingUTD24202537(6): 1518-1541An Exact Algorithm for Multicommodity Network Design Under Stochastic InterdictionsShabnam Mahmoudzadeh Vaziri, Onur Kuzgunkaya, Navneet Vidyarthi被引 7阅读 1高影响力 前 10%计算理论与数学
A+INFORMS Journal on ComputingUTD24201527(2): 204-220The Generalized Regenerator Location ProblemSi Chen, Ivana Ljubić, S. Raghavan被引 34阅读 2高影响力 前 10%计算理论与数学
A+Operations ResearchUTD24FT50201765(3): 595-620Regenerator Location Problem in Flexible Optical NetworksBarış Yıldız, Oya Ekin Karaşan被引 26基金电气与电子工程
