A+INFORMS Journal on ComputingUTD24202234(4): 2192-2211Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time WindowsMartin Wölck, Stephan Meisel被引 8工业与制造工程
A+INFORMS Journal on ComputingUTD24202134(2): 909-933Branch-and-Bound for Biobjective Mixed-Integer Linear ProgrammingNathan Adelgren, Akshay Gupte被引 5阅读 1基金开放获取计算理论与数学
A+INFORMS Journal on ComputingUTD24202436(3): 708-722Solving a Class of Cut-Generating Linear Programs via Machine LearningAtefeh Rajabalizadeh, Danial Davarnia被引 4阅读 1数值分析金融风险与机器学习
A+INFORMS Journal on ComputingUTD24202033(3): 1091-1102An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence ConstraintsWenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson被引 3工业与制造工程
A+INFORMS Journal on ComputingUTD242021Multivariable Branching: A 0-1 Knapsack Problem Case StudyYu Long Yang, Natashia Boland, Martin W. P. Savelsbergh被引 11阅读 1工业与制造工程
A+INFORMS Journal on ComputingUTD24202336(1): 285-304Enhancing Branch-and-Bound for Multiobjective 0-1 ProgrammingNicolas Forget, Sophie N. Parragh被引 6阅读 1基金开放获取计算理论与数学
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 ComputingUTD24201628(1): 67-82Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision DiagramsDavid R. Morrison, Edward C. Sewell, Sheldon H. Jacobson被引 30阅读 1高影响力 前 10%基金开放获取计算理论与数学
A+INFORMS Journal on ComputingUTD24201932(1): 3-15Optimization Bounds from the Branching DualGerdus Benadè, John Hooker被引 1开放获取计算理论与数学
A+INFORMS Journal on ComputingUTD24202234(2): 934-952Estimating the Size of Branch-and-Bound TreesGregor Hendel, Daniel K. Anderson, Pierre Le Bodic, Marc E. Pfetsch被引 13阅读 3数值分析金融风险与机器学习
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阅读 1数值分析
A+INFORMS Journal on ComputingUTD24201729(3): 544-557Numerically Safe Lower Bounds for the Capacitated Vehicle Routing ProblemRicardo Fukasawa, Laurent Poirrier被引 3工业与制造工程
A+INFORMS Journal on ComputingUTD24201729(4): 676-687A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization TechniqueAlexandre Domingues Gonçalves, Artur Alves Pessoa, Cristiana Barbosa Bentes, Ricardo Farias 等 5 人被引 10数值分析
A+INFORMS Journal on ComputingUTD24201931(2): 335-346A Branch-and-Bound Approach to the Traveling Salesman Problem with a DroneStefan Poikonen, Bruce Golden, Edward Wasil被引 249高影响力 前 1%工业与制造工程
A+INFORMS Journal on ComputingUTD24201931(4): 805-822Branch-and-Bound for Bi-objective Integer ProgrammingSophie N. Parragh, Fabien Tricoire被引 46阅读 1开放获取控制与系统工程
A+Operations ResearchUTD24FT50202473(3): 1558-1580Branch-and-Price for Prescriptive Contagion AnalyticsAlexandre Jacquillat, Michael Lingzhi Li, Martin Ramé, Kai Wang被引 6开放获取组织行为与人力资源管理
A+INFORMS Journal on ComputingUTD24202134(2): 1006-1023Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel ProgrammingStefano Coniglio, Stefano Gualandi被引 2基金开放获取计算理论与数学
A+INFORMS Journal on ComputingUTD242021A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor NetworksXiaojun Zhu, Shaojie Tang被引 15阅读 1计算机网络与通信
A+INFORMS Journal on ComputingUTD24201629(1): 108-122Linear Reformulation of Polynomial Discrete Programming for Fast ComputationHan-Lin Li, Yao‐Huei Huang, Shu‐Cherng Fang被引 18阅读 1基金数值分析
A+INFORMS Journal on ComputingUTD24202335(2): 368-385On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling ProblemZhongzhu Chen, Marcia Fampa, Jon Lee被引 8阅读 1基金开放获取数值分析
